Advertisement

Applications of the low-basis theorem in arithmetic

  • P. Clote
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1141)

Keywords

Countable Model Springer Lecture Note Peano Arithmetic Partition Relation Ramsey Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Be]
    D. Bean, "Effective coloration", Journal of Symbolic Logic, vol. 41, (1976), pp. 469–480.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [Cl-1]
    P.G. Clote, "Anti-basis theorems and their relation to independence results in Peano arithmetic", in Model theory and arithmetic, Springer Lecture Notes in Mathematics, vol. 890, (1980), pp. 115–133.MathSciNetCrossRefGoogle Scholar
  3. [Cl-2]
    P.G. Clote, "On recursive trees having a unique infinite branch", to appear in the Proceedings of the American Mathematical Society.Google Scholar
  4. [Cl-3]
    P.G. Clote, "Partition relations in arithmetic", to appear in the Proceedings of the Sixth International Latin American Symposium for Mathematical Logic, Caracas, (1983), 40 pages.Google Scholar
  5. [FoLeO'D]
    S. Fortune, D. Leivant, M. O'Donnell, "The expressiveness of simple and second order type structures", IBM Research Report RC 8542 (37221), October 31, 1980, 70 pages.Google Scholar
  6. [Jo]
    C.G. Jockusch, Jr., "Ramsey's theorem and recursive theory", Journal of Symbolic Logic, vol. 37, (1972), pp. 268–280.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [Ka]
    M. Kaufmann, "On existence of Σn-end extensions", Logic Year 1979–80, Springer Lecture Notes in Mathematics, vol. 859, (1980), pp. 92–103.MathSciNetCrossRefGoogle Scholar
  8. [KiPa]
    L. Kirby and J. Paris, "Σn-collection schemas in arithmetic", Logic Colloquium '77, North Holland, Amsterdam, (1978), pp. 199–209.Google Scholar
  9. [Kr]
    E. Kranakis, "Partition and reflection properties of admissible ordinals", Annals of Mathematical Logic, vol. 22, (1982), pp. 213–242.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [Má]
    A. Máté, "Non-deterministic polynomial time computations and non-standard models of arithmetic", to appear in the JACM.Google Scholar
  11. [LöWa]
    M. Löb and S. Wainer, "Hierarchies of number theoretic functions — part I", Archiv für Mathematische Logik und Grundlagenforschung, vol. 13, (1970), pp. 39–51, Part II in pp. 97–113.CrossRefzbMATHGoogle Scholar
  12. [MaRo]
    A. Manaster and J. Rosenstein, "Effective match-making (recursive theoretic aspects of a theorem of Philip Hall)", Proceedings of the London Mathematical Society, vol. 25, (1972).Google Scholar
  13. [Mc]
    K. McAloon, "Petri nets and large finite sets", Theoretical Computer Science, vol. 31 (1984), pp. 1–11.MathSciNetCrossRefzbMATHGoogle Scholar
  14. [Pa-1]
    J. Paris, "A hierarchy of cuts in models of arithemtic", Model theory of algebra and arithmetic (Proceedings, Karpacz, 1979), Lecture Notes in Mathematics, vol. 834, Springer Verlag, (1980), pp. 312–337.MathSciNetCrossRefGoogle Scholar
  15. [Pa-2]
    J. Paris, "Some conservation results for fragments of arithmetic", Model theory and arithmetic, Springer Lecture Notes in Mathematics, vol. 890, (1980), pp. 251–262.MathSciNetCrossRefGoogle Scholar
  16. [Pars]
    C. Parsons, Abstract in Notices of the American Mathematical Society, vol. 13, (1966), pp. 857–858.Google Scholar
  17. [Pi]
    R. Pino, "Πn-collection, indicatrices et ultrafiltres définissables", These de 3o cycle, Université Paris VII, (1983).Google Scholar
  18. [Pu]
    H. Putnam, "Trial and error predicates and the solution to a problem of Mostowski", Journal of Symbolic Logic, vol. 30, (1965), pp. 49–57.MathSciNetCrossRefzbMATHGoogle Scholar
  19. [Re]
    J. Remmel, "On the effectiveness of the Schröder-Bernstein theorem", Proceedings of the American Mathematical Society, vol. 83, no. 2, (1981), pp. 379–386.MathSciNetzbMATHGoogle Scholar
  20. [Schö]
    U. Schöning, "A low and a high hierarchy within NP", Journal of Computer and System Sciences, vol. 26, (1983), 14 pages.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • P. Clote
    • 1
  1. 1.Université Paris VIIFrance

Personalised recommendations