11 search results - page 2 / 3 » A Cut-Free Sequent System for the Smallest Interpretability ... |
LFCS
1992
Springer
13 years 9 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
LOGCOM
2008
13 years 5 months ago
2008
The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax s...
LICS
2008
IEEE
13 years 12 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...