Order:
  1. Decidable Regularly Closed Fields of Algebraic Numbers.Louden Dries & Rick L. Smith - 1985 - Journal of Symbolic Logic 50 (2):468 - 475.
  2. T-Convexity and Tame Extensions.LouDen Dries & Adam H. Lewenberg - 1995 - Journal of Symbolic Logic 60 (1):74 - 102.
    Let T be a complete o-minimal extension of the theory of real closed fields. We characterize the convex hulls of elementary substructures of models of T and show that the residue field of such a convex hull has a natural expansion to a model of T. We give a quantifier elimination relative to T for the theory of pairs (R, V) where $\mathscr{R} \models T$ and V ≠ R is the convex hull of an elementary substructure of R. We deduce (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. Is the Euclidean Algorithm Optimal Among its Peers?Louden Dries & Yiannis N. Moschovakis - 2004 - Bulletin of Symbolic Logic 10 (3):390 - 418.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark