Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1989: CSL '89 pp 193–210Cite as

Propositional provability and models of weak arithmetic

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 440))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Buss: Bounded Arithmetic, Bibliopolis, Naples, (1986).

    Google Scholar 

  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. S. Buss: Weak End Extensions of Models of Bounded Arithmetic, unpublished manuscript.

    Google Scholar 

  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. S. Cook, A. R. Reckhow: The Relative Efficiency of Propositional Proof Systems, J. Symbolic Logic 44(1), (1979), pp. 36–50.

    Google Scholar 

  6. S. Cook, A. Urquhart: Fuctional Interpretation of Feasibly constructive Arithmetic, Univ. of Toronto, Rep. 210/88, (1988).

    Google Scholar 

  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. M. Dowd: Propositional Representation of Arithmetic Proofs, Ph.D. Thesis, Univ. of Toronto, (1979).

    Google Scholar 

  9. A. Haken: The Intractability of Resolution, Theor. Comp. Sci. 39, (1985), pp. 297–308.

    Article  Google Scholar 

  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. J. Krajíček, P. Pudlák: Quantified Propositional Calculi and Fragments of Bounded Arithmetic, Zeitschrift f. Math. Logik, to appear.

    Google Scholar 

  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. A. Wilkie: Subsystems of Arithmetic and Complexity Theory, an invited talk at 8th Int. Congress LMPS' 87, Moscow, (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute at Prague, Czechoslovakia

    Jan Krajíček & Pavel Pudlák

Authors
  1. Jan Krajíček
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavel Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krajíček, J., Pudlák, P. (1990). Propositional provability and models of weak arithmetic. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-52753-2_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52753-4

  • Online ISBN: 978-3-540-47137-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation