123 search results - page 4 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
144
click to vote
LICS
1991
IEEE
15 years 3 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
CADE
2004
Springer
16 years 3 days 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...
LOGCOM
2002
14 years 11 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
104
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
CADE
2007
Springer
16 years 3 days ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...