3658 search results - page 97 / 732 » The logic of proofs, semantically |
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
CSL
2007
Springer
14 years 4 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...
LICS
1995
IEEE
14 years 1 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
JSYML
2011
13 years 5 months ago
2011
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
TABLEAUX
2000
Springer
14 years 2 months ago
2000
Springer
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...