119 search results - page 7 / 24 » A First-Order Isomorphism Theorem |
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
TPHOL
2003
IEEE
14 years 22 days ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...