Skip to main content

A Characterisation of the Relations Definable in Presburger Arithmetic

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4978))

Abstract

Four sub-recursive classes of functions, \({\mathcal{B}}\), \({\mathcal{D}}\), \({\mathcal{BD}}\) and \({\mathcal{BDD}}\) are defined, and compared to the classes G 0, G 1 and G 2, originally defined by Grzegorczyk, based on bounded minimalisation, and characterised by Harrow in [5]. \({\mathcal{B}}\) is essentially G 0 with predecessor substituted for successor; \({\mathcal{BD}}\) is G 1 with (truncated) difference substituted for addition. We prove that the induced relational classes are preserved (\(G^0_\star={\mathcal{B}}_\star\) and \(G^1_\star={\mathcal{BD}}_\star\)). We also obtain \({\mathcal{D}}_\star={{{\mathfrak{PrA}}^{\text{\tiny qf}}}_\star}\) (the quantifier free fragment of Presburger Arithmetic), and \({\mathcal{BD}}_\star={\mathfrak{PrA}}_\star\), and \({\mathcal{BDD}}_\star=G^2_\star\), where \({\mathcal{BDD}}\) is G 2 with integer division and remainder substituted for multiplication, and where \(G^2_\star\) is known to be equal to the predicates definable by a bounded formula in Peano Arithmetic.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bennett, J.H.: On Spectra, Ph.D. thesis, Princeton University (1962)

    Google Scholar 

  2. Clote, P.: Computation Models and Function Algebra. In: Handbook of Computability Theory, Elsevier, Amsterdam (1996)

    Google Scholar 

  3. Enderton, H.B.: A mathematical introduction to logic. Academic Press, Inc., San Diego (1972)

    MATH  Google Scholar 

  4. Grzegorczyk, A.: Some classes of recursive functions. In: Rozprawy Matematyczne, vol. IV, Warszawa (1953)

    Google Scholar 

  5. Harrow, K.: Sub-elementary classes of functions and relations, Ph.D.Thesis, New York University (1973)

    Google Scholar 

  6. Harrow, K.: Small Grzegorczyk classes and limited minimum. Zeitscr. f. math. Logik und Grundlagen d. Math. 21, 417–426 (1975)

    MATH  MathSciNet  Google Scholar 

  7. Jones, N.D.: Logspace and Ptime characterized by programming languages. Theoretical Computer Science 228, 151–174 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming 11, 55–94 (2001)

    Article  MATH  Google Scholar 

  9. Kristiansen, L.: Neat function algebraic characterizations of logspace and linspace. Computational Complexity 14(1), 72–88 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kristiansen, L.: Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T: Theory of Computing Systems (2007), http://www.springerlink.com/content/e53l54627x063685/

  11. Kristiansen, L., Barra, M.: The small Grzegorczyk classes and the typed λ-calculus. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 252–262. Springer, Heidelberg (2005)

    Google Scholar 

  12. Kristiansen, L., Voda, P.J.: The surprising power of restricted programs and Gödel’s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 345–358. Springer, Heidelberg (2003)

    Google Scholar 

  13. Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters 88, 213–218 (2003)

    Article  MathSciNet  Google Scholar 

  14. Lipton, R.J.: Model theoretic aspects of computational complexity. In: Proc. \({19}^\text{\tiny{th}}\) Annual Symp. on Foundations of Computer Science, Silver Spring MD, pp. 193–200. IEEE Computer Society, Los Alamitos (1978)

    Google Scholar 

  15. Presburger, M.: Über die Vollständigket eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Sprawozdanie z I Kongresu Matematyków Słowańskich, pp. 92–101 (1930)

    Google Scholar 

  16. Presburger, M., Jaquette, D.: On the Completeness of a Certain System of Arithmetic of Whole Numbers in Which Addition Occurs as the Only Operation. History and Philosophy of Logic 12, 225–233 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Smullyan, R.M.: Theory of formal systems (revised edition). Princeton University Press, Princeton, New Jersey (1961)

    Google Scholar 

  18. Wrathall, C.: Rudimentary predicates and relative computation. SIAM J. Comput. 7(2), 194–209 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manindra Agrawal Dingzhu Du Zhenhua Duan Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barra, M. (2008). A Characterisation of the Relations Definable in Presburger Arithmetic. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79228-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79227-7

  • Online ISBN: 978-3-540-79228-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics