3690 search results - page 5 / 738 » Computation with classical sequents |
83
Voted
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
BSL
1999
14 years 9 months ago
1999
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
APAL
2010
14 years 9 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
85
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...