Switch to: References

Add citations

You must login to add citations.
  1. Strongly determined types.Alexandre A. Ivanov & Dugald Macpherson - 1999 - Annals of Pure and Applied Logic 99 (1-3):197-230.
    The notion of a strongly determined type over A extending p is introduced, where p .S. A strongly determined extension of p over A assigns, for any model M )- A, a type q S extending p such that, if realises q, then any elementary partial map M → M which fixes acleq pointwise is elementary over . This gives a crude notion of independence which arises very frequently. Examples are provided of many different kinds of theories with strongly determined (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • On non-abelian C-minimal groups.Patrick Simonetta - 2003 - Annals of Pure and Applied Logic 122 (1-3):263-287.
    We investigate the structure of C-minimal valued groups that are not abelian-by-finite. We prove among other things that they are nilpotent-by-finite.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Special transformations in algebraically closed valued fields.Yimu Yin - 2010 - Annals of Pure and Applied Logic 161 (12):1541-1564.
    We present two of the three major steps in the construction of motivic integration, that is, a homomorphism between Grothendieck semigroups that are associated with a first-order theory of algebraically closed valued fields, in the fundamental work of Hrushovski and Kazhdan [8]. We limit our attention to a simple major subclass of V-minimal theories of the form ACV FS, that is, the theory of algebraically closed valued fields of pure characteristic 0 expanded by a -generated substructure S in the language (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Computable axiomatizability of elementary classes.Peter Sinclair - 2016 - Mathematical Logic Quarterly 62 (1-2):46-51.
    The goal of this paper is to generalise Alex Rennet's proof of the non‐axiomatizability of the class of pseudo‐o‐minimal structures. Rennet showed that if is an expansion of the language of ordered fields and is the class of pseudo‐o‐minimal ‐structures (‐structures elementarily equivalent to an ultraproduct of o‐minimal structures) then is not computably axiomatizable. We give a general version of this theorem, and apply it to several classes of structures.
    Download  
     
    Export citation  
     
    Bookmark  
  • A criterion for uniform finiteness in the imaginary sorts.Will Johnson - 2022 - Archive for Mathematical Logic 61 (3):583-589.
    Let T be a theory. If T eliminates \, it need not follow that \ eliminates \, as shown by the example of the p-adics. We give a criterion to determine whether \ eliminates \. Specifically, we show that \ eliminates \ if and only if \ is eliminated on all interpretable sets of “unary imaginaries.” This criterion can be applied in cases where a full description of \ is unknown. As an application, we show that \ eliminates \ when (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On some definable sets over fields with analytic structure.Y. Fırat Çelı̇kler - 2010 - Annals of Pure and Applied Logic 161 (4):599-616.
    We discover geometric properties of certain definable sets over non-Archimedean valued fields with analytic structures. Results include a parameterized smooth stratification theorem and the existence of a bound on the piece number of fibers for these sets. In addition, we develop a dimension theory for these sets and also for the formulas which define them.
    Download  
     
    Export citation  
     
    Bookmark