Optimal bounds for ordinal comparison maps

  • Peter Clote


In this note, we answer the following question: Given two recursively presented well orderingsR, S of subsets of the natural numbers, what is the complexity of an ordinal comparison mapκ takingR isomorphically onto an initial segment ofS (or vice versa)?


Natural Number Mathematical Logic Initial Segment Optimal Bound Ordinal Comparison 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CCSSW]
    Cenzer, D., Clote, P., Smith, R., Soare, R.I., Wainer, S.S.: Members of countableII 01 classes (to appear in Ann. Pure Appl. Logic).Google Scholar
  2. [Ch]
    Chen, K.H.: Recursive well-founded orderings. Ann. Math. Logic13, 117–147 (1978).CrossRefGoogle Scholar
  3. [C11]
    Clote, P.: Anti-basis theorems and their relation to independence results in Peano arithmetic. In Model theory and arithmetic. Springer Lecture Notes in Mathematics890, 115–133 (1980).Google Scholar
  4. [C12]
    Clote, P.: A recursion theoretic analysis of the clopen Ramsey theorem. J. Symb. Logic49, (2), 376–400 (1984).Google Scholar
  5. [C13]
    Clote, P.: On recursive trees with a unique infinite branch. Proc. Am. Math. Soc.93, (2), 335–342 (1985).Google Scholar
  6. [C14]
    Clote, P.: A generalization of the limit lemma and clopen games (to appear in J. Symb. Logic).Google Scholar
  7. [CM]
    Cenzer, D., Mauldin, R.D.: On the Borel class of the derived set operator. II. Bull. Soc. math. France111, 367–372 (1983).Google Scholar
  8. [Fr1]
    Friedman, H.: Systems of second order arithmetic with limited induction (Abstract). J. Symb. Logic41, 557–559 (1976).Google Scholar
  9. [Fr2]
    Friedman, H.: The metamathematics of the Higman and Kruskal theorems (in preparation).Google Scholar
  10. [HMR]
    Hay, L., Manaster, A., Rosenstein, J.: Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy. Ann. Math. Logic8, 297–343 (1975).CrossRefGoogle Scholar
  11. [KSW]
    Kreisel, G., Shoenfield, J., Wang, H.: Number theoretic concepts and recursive well orderings. Arch. math. Logik Grundlagenforsch.5, 42–64 (1960).CrossRefGoogle Scholar
  12. [Ro]
    Rogers, H., Jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967.Google Scholar
  13. [Sp]
    Spector, C.: Recursive well orderings. J. Symb. Logic20, 151–163 (1955).Google Scholar

Copyright information

© Verlag W. Kohlhammer 1985

Authors and Affiliations

  • Peter Clote
    • 1
  1. 1.Department of Computer ScienceBoston CollegeChestnut HillUSA

Personalised recommendations