Quantified propositional calculi and fragments of bounded arithmetic
- 1 January 1990
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 36 (1), 29-46
- https://doi.org/10.1002/malq.19900360106
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- The intractability of resolutionTheoretical Computer Science, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- Propositional representation of arithmetic proofs (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1978
- Feasibly constructive proofs and the propositional calculus (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1975