Propositional provability and models of weak arithmetic

  • Jan Krajíček
  • Pavel Pudlák
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 440)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Buss: Bounded Arithmetic, Bibliopolis, Naples, (1986).Google Scholar
  2. [2]
    S. Buss: Axiomatization and Conservation Results for Fragments of Bounded Arithmetic, in: Workshop in Logic and Computation, AMS Contemporary Mathematics, to appear.Google Scholar
  3. [3]
    S. Buss: Weak End Extensions of Models of Bounded Arithmetic, unpublished manuscript.Google Scholar
  4. [4]
    S. Cook: Feasibly Constructive Propositional Calculus, in: Proc. 7th A.C.M. Symp. on Th. of Comp., (1975), pp. 83–97.Google Scholar
  5. [5]
    S. Cook, A. R. Reckhow: The Relative Efficiency of Propositional Proof Systems, J. Symbolic Logic 44(1), (1979), pp. 36–50.Google Scholar
  6. [6]
    S. Cook, A. Urquhart: Fuctional Interpretation of Feasibly constructive Arithmetic, Univ. of Toronto, Rep. 210/88, (1988).Google Scholar
  7. [7]
    R. A. DeMillo, R. J. Lipton: Some Connections Between Mathematical Logic and Complexity Theory, in: Proc. 11th A.C.M. Symp. on Th. of Comp., (1979), pp. 153–158.Google Scholar
  8. [8]
    M. Dowd: Propositional Representation of Arithmetic Proofs, Ph.D. Thesis, Univ. of Toronto, (1979).Google Scholar
  9. [9]
    A. Haken: The Intractability of Resolution, Theor. Comp. Sci. 39, (1985), pp. 297–308.CrossRefGoogle Scholar
  10. [10]
    J. Krajíček, P. Pudlák: Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations, J. Symbolic Logic, to appear.Google Scholar
  11. [11]
    J. Krajíček, P. Pudlák: Quantified Propositional Calculi and Fragments of Bounded Arithmetic, Zeitschrift f. Math. Logik, to appear.Google Scholar
  12. [12]
    J. Krajíček, P. Pudlák, G. Takeuti: Bounded Arithmetic and the Polynomial Hierarchy, Annals of Pure and Applied Logic, submitted.Google Scholar
  13. [13]
    A. Wilkie: Subsystems of Arithmetic and Complexity Theory, an invited talk at 8th Int. Congress LMPS' 87, Moscow, (1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Jan Krajíček
    • 1
  • Pavel Pudlák
    • 1
  1. 1.Mathematical Institute at PragueCzechoslovakia

Personalised recommendations