34 search results - page 1 / 7 » Automated Theorem Proving in a Simple Meta-Logic for LF |
CADE
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
TPHOL
1993
IEEE
13 years 9 months ago
1993
IEEE
Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed and oversights and other ...
AMAI
2007
Springer
13 years 4 months ago
2007
Springer
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
TPHOL
1999
IEEE
13 years 9 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...