Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - Mathematical foundations of computer science
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Optimal proof systems imply complete sets for promise classes
Information and Computation
On the automatizability of resolution and related propositional proof systems
Information and Computation
Classes of representable disjoint NP-pairs
Theoretical Computer Science
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
The deduction theorem for strong propositional proof systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.00 |
In this paper we define and investigate basic logical closure properties of propositional proof systems such as closure of arbitrary proof systems under modus ponens or substitutions. As our main result we obtain a purely logical characterization of the degrees of schematic extensions of EF in terms of a simple combination of these properties. This result underlines the empirical evidence that EF and its extensions admit a robust definition which rests on only a few central concepts from propositional logic.