Sciweavers

123 search results - page 3 / 25
» The Deduction Theorem for Strong Propositional Proof Systems
Sort
View
ECCC
2006
93views more  ECCC 2006»
14 years 9 months ago
On the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
Olaf Beyersdorff
CORR
2008
Springer
148views Education» more  CORR 2008»
14 years 8 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
CORR
2010
Springer
158views Education» more  CORR 2010»
14 years 9 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka
TLCA
2005
Springer
15 years 3 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
IPL
2006
100views more  IPL 2006»
14 years 9 months ago
Strong normalization proofs by CPS-translations
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
Satoshi Ikeda, Koji Nakazawa