Title: Quantified propositional calculi and fragments of bounded arithmetic
Abstract: Mathematical Logic QuarterlyVolume 36, Issue 1 p. 29-46 Article Quantified propositional calculi and fragments of bounded arithmetic Jan Krajíček, Jan Krajíček Mathematical Institute Czechoslovak Academy of Sciences Žitná 25 11567 Praha 1 CSSRSearch for more papers by this authorPavel Pudlák, Pavel Pudlák Mathematical Institute Czechoslovak Academy of Sciences Žitná 25 11567 Praha 1 CSSRSearch for more papers by this author Jan Krajíček, Jan Krajíček Mathematical Institute Czechoslovak Academy of Sciences Žitná 25 11567 Praha 1 CSSRSearch for more papers by this authorPavel Pudlák, Pavel Pudlák Mathematical Institute Czechoslovak Academy of Sciences Žitná 25 11567 Praha 1 CSSRSearch for more papers by this author First published: 1990 https://doi.org/10.1002/malq.19900360106Citations: 62AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL References 1 Buss, S. R., Bounded Arithmetic. Bibliopolis, Napoli 1986. 2 Buss, S. R., Axiomatizations and conservation results for fragments of bounded arithmetic. Manuscript, Univ. of California at Berkeley, 1987, 24 p. 3 Church, A., Introduction to Mathematical Logic, vol. I. Princeton University Press, Princeton, N.J. 1956. 4 Cook, S. A., Feasibly constructive proofs and the propositional calculus. In: Proc. of the 7th Annual ACM Symp. on Theory of Computing (STOC) 1975, pp. 83– 99. 5 Cook, S. A., and R. A. Reckhow, The relative efficiency of propositional proof systems. J. Symbolic Logic 44 (1979), 36– 50. 6 Dowd, M., Model Theoretic Aspects of P = NP. Manuscript. 7 Dowd, M., Propositional Representation of Arithmetic Proofs. Ph.D. dissertation, Univ. of Toronto 1979. 8 Haken, A., The intractability of resolution. Theor. Comput. Sci. 39 (1985), 297– 308. 9 Krajíček, J., and P. Pudlák, Propositional proof systems, the consistency of first order theories and the complexity of computations. J. Symbolic Logic (to appear). 10 Takeuti, G., Proof Theory. North-Holland Publ. Comp., Amsterdam 1975. 11 Wilkie, A. J., Subsystems of Arithmetic and Complexity Theory. Invited talk at 8th Intern. Congress LMPS '87, Moscow 1987. Citing Literature Volume36, Issue11990Pages 29-46 ReferencesRelatedInformation
Publication Year: 1990
Publication Date: 1990-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 102
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot