On the meaning of essentially unprovable theorems in the presburger theory of addition

  • Giovanni Faglia
  • Paul Young
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 713)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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
  2. 2.
    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
  3. 3.
    Faglia, G.: Double Exponential Inseparability of the Robinson Subsystem Q+ from the Unsatisfiable Sentences in the Language of Addition. This volume.Google Scholar
  4. 4.
    Faglia, G., Young, P.: On The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition. In Theoretical Computer Science — Proceedings of the 4th Italian Conference World Scientific Publishing Co. Pte. Ltd., (1992) 214–228.Google Scholar
  5. 5.
    Fischer, M.J., Rabin, M.: Super-Exponential Complexity of Presburger Arithmetic. In Complexity of Computation, SIAM-AMS, (1974) 27–48.Google Scholar
  6. 6.
    Robinson, R.M.: An Essentially Undecidable Axiom System. In Proceedings of the International Congress of Mathematicians. Cambridge, 1, (1950) 729–30.Google Scholar
  7. 7.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Giovanni Faglia
    • 1
  • Paul Young
    • 2
  1. 1.Dottorato di Ricerca in InformaticaUniversità di Torino e MilanoMilanoItaly
  2. 2.Department of Computer Science and Engineering, FR-35University of WashingtonSeattleUSA

Personalised recommendations