Skip to main content
SpringerLink
Log in

Is There A Simple, Pedestrian Arithmetic Sentence Which Is Independent Of Zfc?

  • Published:
Synthese Aims and scope Submit manuscript

Abstract

We show that the P < NP conjecture can beformulated as a Pi2 0 sentence, and explore some of theconsequences of that fact. This paper summarizes recent workby the author with N. C. A. da Costa on the P<NPconjecture and on the possibility that this sentence isindependent of ZFC supposed consistent.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  • Baker, T., J. Gill, and R. Solovay: 1975, 'Relativizations of the P=?NP question', SIAM Journal of Computing 4, 431.

    Google Scholar 

  • da Costa, N. C. A. and F. A. Doria: 1999a, 'On Total Recursive, But Not T-Total Recursive Functions', preprint IEA-USP.

  • da Costa, N. C. A. and F. A. Doria: 1999b, "Fast-Growing Functions Defined over Bounded Turing Machines in ZFC: A Consistency Result for Strictly Partial Functions', preprint IEA-USP.

  • de Millo, R. A. and R. J. Lipton: 1980, 'The Consistency of "P D NP" and Related Problems with Fragments of Number Theory', Proc. 12th ACM Symp. on the Theory of Computing, 45.

  • Doria, F. A.: 1996, Logique et Analyse 153/154, 165

    Google Scholar 

  • Johnson, D. S.: 1990, 'A Catalogue of Complexity Classes', in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier.

  • Ketonen, J. and R. Solovay: 1981, 'Rapidly Rising Ramsey Functions', Annals of Mathematics 113, 267.

    Google Scholar 

  • Kreisel, G.: 1951, 'On the Interpretation of Non-Finitist Proofs, I and II', J. Symbol. Logic 16, 241; 17, 43 (1952).

    Google Scholar 

  • Machtey, M. and P. Young: 1979, An Introduction to the General Theory of Algorithms, North-Holland.

  • Wainer, S. S.: 1970, Arch. Math. Logik 13, 136.

    Google Scholar 

  • Wainer, S. S.: 1999, 'Accessible Recursive Functions', preprint, Department of Mathematics, University of Leeds.

Download references

Author information

Authors and Affiliations

  1. Research Group on Logic and Foundations Institute for Advanced Studies, University of São Paulo, Brazil

    Francisco Antonio Doria

Authors
  1. Francisco Antonio Doria
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Doria, F.A. Is There A Simple, Pedestrian Arithmetic Sentence Which Is Independent Of Zfc?. Synthese 125, 69–76 (2000). https://doi.org/10.1023/A:1005244002066

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005244002066

Search

Navigation