Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Ordered groups: A case study in reverse mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.
    The fundamental question in reverse mathematics is to determine which set existence axioms are required to prove particular theorems of mathematics. In addition to being interesting in their own right, answers to this question have consequences in both effective mathematics and the foundations of mathematics. Before discussing these consequences, we need to be more specific about the motivating question.Reverse mathematics is useful for studying theorems of either countable or essentially countable mathematics. Essentially countable mathematics is a vague term that is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Weak comparability of well orderings and reverse mathematics.Harvey M. Friedman & Jeffry L. Hirst - 1990 - Annals of Pure and Applied Logic 47 (1):11-29.
    Two countable well orderings are weakly comparable if there is an order preserving injection of one into the other. We say the well orderings are strongly comparable if the injection is an isomorphism between one ordering and an initial segment of the other. In [5], Friedman announced that the statement “any two countable well orderings are strongly comparable” is equivalent to ATR 0 . Simpson provides a detailed proof of this result in Chapter 5 of [13]. More recently, Friedman has (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Degrees of orderings not isomorphic to recursive linear orderings.Carl G. Jockusch & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 52 (1-2):39-64.
    It is shown that for every nonzero r.e. degree c there is a linear ordering of degree c which is not isomorphic to any recursive linear ordering. It follows that there is a linear ordering of low degree which is not isomorphic to any recursive linear ordering. It is shown further that there is a linear ordering L such that L is not isomorphic to any recursive linear ordering, and L together with its ‘infinitely far apart’ relation is of low (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
    Download  
     
    Export citation  
     
    Bookmark   65 citations  
  • Set Theory. An Introduction to Independence Proofs.James E. Baumgartner & Kenneth Kunen - 1986 - Journal of Symbolic Logic 51 (2):462.
    Download  
     
    Export citation  
     
    Bookmark   149 citations