Skip to main content
SpringerLink
Log in

Applications of complexity theory to Σo-definability Problems in arithmetic

  • Conference paper
  • First Online:
Model Theory of Algebra and Arithmetic

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 834))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.H. Bennett, "On Spectra", Ph.D. dissertation, Princeton University, (1962).

    Google Scholar 

  2. K.L. Manders, "Computational Complexity of Decision Problems in Elementary Number Theory", this volume.

    Google Scholar 

  3. J. Meloul, "Rudimentary Predicates, Low Complexity Classes and Related Automata", D.Phil. dissertation, Oxford University, (1979).

    Google Scholar 

  4. V.A. Nepomnjascii, "Rudimentary Interpretations of Two-Tape Turing Computation", Kebernetika, 6, (1970). Translated in: Cybernetics, December (1972).

    Google Scholar 

  5. R. Parikh, "Existence and Feasibility in Arithmetic", J.S.L. 36, (1971).

    Google Scholar 

  6. R. Smullyan, "Theory of Formal Systems", Annals of Mathematics Studies no. 47, Princeton University Press, (1961).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Oxford, England

    A. J. Wilkie

Authors
  1. A. J. Wilkie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jedrzej Wierzejewski Alec J. Wilkie

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Wilkie, A.J. (1980). Applications of complexity theory to Σo-definability Problems in arithmetic. In: Pacholski, L., Wierzejewski, J., Wilkie, A.J. (eds) Model Theory of Algebra and Arithmetic. Lecture Notes in Mathematics, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090174

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38393-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation