Skip to main content
SpringerLink
Log in

Double exponential inseparability of Robinson subsystem Q+ from the unsatisfiable sentences in the language of addition

  • Contributed Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1993)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Berman L.: The Complexity of Logical Theories. Theoretical Computer Science, (1980) 11:71–77.

    Google Scholar 

  2. Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48 (1990) 1–79.

    Google Scholar 

  3. Faglia, G.: Double exponential inseparability of theories of addition. PhD thesis, Dottorato di Ricerca in Informatica, Università di Torino e Milano, Via Comelico 39, I-20135 Milano MI, Italy, February 1993. In Italian.

    Google Scholar 

  4. Fischer, M.J., Rabin, M.: Super-Exponential Complexity of Presburger Arithmetic. In Complexity of Computation, SIAM-AMS, (1974) 27–48.

    Google Scholar 

  5. Hilbert, D., Bernays, P.: Grundlagen der Mathematik, volume 1. Springer, (1934).

    Google Scholar 

  6. Presburger M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt. In Comptes-Rendus du 1er Congrès des Mathématiciens des Pays Slavs, (1929).

    Google Scholar 

  7. Robinson, R.M.: An Essentially Undecidable Axiom System. In Proceedings of the International Congress of Mathematicians. Cambridge, 1, (1950) 729–30.

    Google Scholar 

  8. Tarski, A., Mostowsky, A., Robinson, R.: Undecidable Theories. North-Holland, (1953).

    Google Scholar 

  9. Young, P.: Gödel Theorems, Exponential Difficulty and Undecidability of Arithmetic Theories: An Exposition. In Proceedings of Symposia in Pure Mathematics, American Mathematical Society, (1985) 503–522.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dottorato di Ricerca in Informatica, Università di Torino e Milano, via Comelico 39/41, I-20135, Milano, Italy

    Giovanni Faglia

Authors
  1. Giovanni Faglia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Faglia, G. (1993). Double exponential inseparability of Robinson subsystem Q+ from the unsatisfiable sentences in the language of addition. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022566

Download citation

  • DOI: https://doi.org/10.1007/BFb0022566

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57184-1

  • Online ISBN: 978-3-540-47943-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation