Advertisement

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

  • A. J. Wilkie
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 834)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.H. Bennett, "On Spectra", Ph.D. dissertation, Princeton University, (1962).Google Scholar
  2. [2]
    K.L. Manders, "Computational Complexity of Decision Problems in Elementary Number Theory", this volume.Google Scholar
  3. [3]
    J. Meloul, "Rudimentary Predicates, Low Complexity Classes and Related Automata", D.Phil. dissertation, Oxford University, (1979).Google Scholar
  4. [4]
    V.A. Nepomnjascii, "Rudimentary Interpretations of Two-Tape Turing Computation", Kebernetika, 6, (1970). Translated in: Cybernetics, December (1972).Google Scholar
  5. [5]
    R. Parikh, "Existence and Feasibility in Arithmetic", J.S.L. 36, (1971).Google Scholar
  6. [6]
    R. Smullyan, "Theory of Formal Systems", Annals of Mathematics Studies no. 47, Princeton University Press, (1961).Google Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • A. J. Wilkie
    • 1
  1. 1.Mathematical InstituteOxfordEngland

Personalised recommendations