Switch to: References

Add citations

You must login to add citations.
  1. Mutual definability does not imply definitional equivalence, a simple example.Hajnal Andréka, Judit X. Madarász & István Németi - 2005 - Mathematical Logic Quarterly 51 (6):591-597.
    We give two theories, Th1 and Th2, which are explicitly definable over each other , but are not definitionally equivalent. The languages of the two theories are disjoint.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Completely decomposable abelian groups -categorical over a subgroup.Roger Villemaire - 1992 - Archive for Mathematical Logic 31 (4):263-275.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Interpreting groups in ω-categorical structures.Dugald Macpherson - 1991 - Journal of Symbolic Logic 56 (4):1317-1324.
    It is shown that no infinite group is interpretable in any structure which is homogeneous in a finite relational language. Related questions are discussed for other ω-categorical structures.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A model and its subset: the uncountable case.Ludomir Newelski - 1995 - Annals of Pure and Applied Logic 71 (2):107-129.
    Assume Q is a definable subset of a model of T. We define a notion of Q-isolated type, generalizing an earlier definition for countable Q. This notion is absolute. For superstable T, we give some sufficient conditions for the existence of Q-atomic models. We apply this to prove some results on weak categoricity over a predicate.
    Download  
     
    Export citation  
     
    Bookmark  
  • On reduction properties.Hirotaka Kikyo & Akito Tsuboi - 1994 - Journal of Symbolic Logic 59 (3):900-911.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A model and its subset.Ludomir Newelski - 1992 - Journal of Symbolic Logic 57 (2):644-658.
    We try to count the number of countable models M of T with a fixed set Q = φ (M) of realizations of a type φ. Also, for stable T, we define an ordinal rank M measuring multiplicity of types, with additivity properties similar to those of U-rank.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Weak elimination of imaginaries for Boolean algebras.Roman Wencel - 2005 - Annals of Pure and Applied Logic 132 (2-3):247-270.
    We give a complete characterization of Boolean algebras admitting weak elimination of imaginaries in terms of elementary invariants.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
    Download  
     
    Export citation  
     
    Bookmark   30 citations