Switch to: References

Add citations

You must login to add citations.
  1. Projective geometries of algebraically closed fields of characteristic zero.Kitty L. Holland - 1993 - Annals of Pure and Applied Logic 60 (3):237-260.
    Fix an algebraically closed field of characteristic zero and let G be its geometry of transcendence degree one extensions. Let X be a set of points of G. We show that X extends to a projective subgeometry of G exactly if the partial derivatives of the polynomials inducing dependence on its elements satisfy certain separability conditions. This analysis produces a concrete representation of the coordinatizing fields of maximal projective subgeometries of G.
    Download  
     
    Export citation  
     
    Bookmark  
  • More undecidable lattices of Steinitz exchange systems.L. R. Galminas & John W. Rosenthal - 2002 - Journal of Symbolic Logic 67 (2):859-878.
    We show that the first order theory of the lattice $\mathscr{L}^{ (S) of finite dimensional closed subsets of any nontrivial infinite dimensional Steinitz Exhange System S has logical complexity at least that of first order number theory and that the first order theory of the lattice L(S ∞ ) of computably enumerable closed subsets of any nontrivial infinite dimensional computable Steinitz Exchange System S ∞ has logical complexity exactly that of first order number theory. Thus, for example, the lattice of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Pseudoprojective strongly minimal sets are locally projective.Steven Buechler - 1991 - Journal of Symbolic Logic 56 (4):1184-1194.
    Let D be a strongly minimal set in the language L, and $D' \supset D$ an elementary extension with infinite dimension over D. Add to L a unary predicate symbol D and let T' be the theory of the structure (D', D), where D interprets the predicate D. It is known that T' is ω-stable. We prove Theorem A. If D is not locally modular, then T' has Morley rank ω. We say that a strongly minimal set D is pseudoprojective (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Some highly undecidable lattices.Menachem Magidor, John W. Rosenthal, Mattiyahu Rubin & Gabriel Srour - 1990 - Annals of Pure and Applied Logic 46 (1):41-63.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Sound, totally sound, and unsound recursive equivalence types.R. G. Downey - 1986 - Annals of Pure and Applied Logic 31:1-20.
    Download  
     
    Export citation  
     
    Bookmark