Switch to: Citations

Add references

You must login to add references.
  1. Computability theory and linear orders.Rod Downey - 1998 - In IUrii Leonidovich Ershov (ed.), Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
    We study theorems of ordered groups from the perspective of reverse mathematics. We show that suffices to prove Hölder's Theorem and give equivalences of both (the orderability of torsion free nilpotent groups and direct products, the classical semigroup conditions for orderability) and (the existence of induced partial orders in quotient groups, the existence of the center, and the existence of the strong divisible closure).
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Hiearchies of Boolean algebras.Lawrence Feiner - 1970 - Journal of Symbolic Logic 35 (3):365-374.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
    Download  
     
    Export citation  
     
    Bookmark   234 citations