12 found
Order:
  1.  60
    Characterizing Rosy Theories.Clifton Ealy & Alf Onshuus - 2007 - Journal of Symbolic Logic 72 (3):919 - 940.
    We examine several conditions, either the existence of a rank or a particular property of þ-forking that suggest the existence of a well-behaved independence relation, and determine the consequences of each of these conditions towards the rosiness of the theory. In particular we show that the existence of an ordinal valued equivalence relation rank is a (necessary and) sufficient condition for rosiness.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  2.  51
    Properties and Consequences of Thorn-Independence.Alf Onshuus - 2006 - Journal of Symbolic Logic 71 (1):1 - 21.
    We develop a new notion of independence (þ-independence, read "thorn"-independence) that arises from a family of ranks suggested by Scanlon (þ-ranks). We prove that in a large class of theories (including simple theories and o-minimal theories) this notion has many of the properties needed for an adequate geometric structure. We prove that þ-independence agrees with the usual independence notions in stable, supersimple and o-minimal theories. Furthermore, we give some evidence that the equivalence between forking and þ-forking in simple theories might (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  3.  41
    On dp-minimality, strong dependence and weight.Alf Onshuus & Alexander Usvyatsov - 2011 - Journal of Symbolic Logic 76 (3):737 - 758.
    We study dp-minimal and strongly dependent theories and investigate connections between these notions and weight.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  4.  43
    The independence property in generalized dense pairs of structures.Alexander Berenstein, Alf Dolich & Alf Onshuus - 2011 - Journal of Symbolic Logic 76 (2):391 - 404.
    We provide a general theorem implying that for a (strongly) dependent theory T the theory of sufficiently well-behaved pairs of models of T is again (strongly) dependent. We apply the theorem to the case of lovely pairs of thorn-rank one theories as well as to a setting of dense pairs of first-order topological theories.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  5.  32
    On linearly ordered structures of finite rank.Alf Onshuus & Charles Steinhorn - 2009 - Journal of Mathematical Logic 9 (2):201-239.
    O-minimal structures have long been thought to occupy the base of a hierarchy of ordered structures, in analogy with the role that strongly minimal structures play with respect to stable theories. This is the first in an anticipated series of papers whose aim is the development of model theory for ordered structures of rank greater than one. A class of ordered structures to which a notion of finite rank can be assigned, the decomposable structures, is introduced here. These include all (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  28
    Classifying torsion free groups in o-minimal expansions of real closed fields.Eliana Barriga & Alf Onshuus - 2016 - Annals of Pure and Applied Logic 167 (12):1267-1297.
  7.  25
    Definable groups in models of Presburger Arithmetic.Alf Onshuus & Mariana Vicaría - 2020 - Annals of Pure and Applied Logic 171 (6):102795.
    This paper is devoted to understand groups definable in Presburger Arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded abelian group definable in a model of (Z, +, <) Presburger Arithmetic is definably isomorphic to (Z, +)^n mod out by a lattice.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  33
    Stable domination and weight.Alf Onshuus & Alexander Usvyatsov - 2011 - Annals of Pure and Applied Logic 162 (7):544-560.
    We develop the theory of domination by stable types and stable weight in an arbitrary theory.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  49
    Stable types in rosy theories.Assaf Hasson & Alf Onshuus - 2010 - Journal of Symbolic Logic 75 (4):1211-1230.
    We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to show that a rosy group with a þ-generic stable type is stable. In the context of super-rosy theories of finite rank we conclude that non-trivial stable types of U þ -rank 1 must arise from definable stable sets.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  26
    A note on stable sets, groups, and theories with NIP.Alf Onshuus & Ya'acov Peterzil - 2007 - Mathematical Logic Quarterly 53 (3):295-300.
    Let M be an arbitrary structure. Then we say that an M -formula φ defines a stable set inM if every formula φ ∧ α is stable. We prove: If G is an M -definable group and every definable stable subset of G has U -rank at most n , then G has a maximal connected stable normal subgroup H such that G /H is purely unstable. The assumptions hold for example if M is interpretable in an o-minimal structure.More generally, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  21
    A fixed-point theorem for definably amenable groups.Juan Felipe Carmona, Kevin Dávila, Alf Onshuus & Rafael Zamora - 2020 - Archive for Mathematical Logic 60 (3-4):413-424.
    We prove an analogue of the fixed-point theorem for the case of definably amenable groups.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  29
    Consistent amalgamation for þ-forking.Clifton Ealy & Alf Onshuus - 2014 - Annals of Pure and Applied Logic 165 (2):503-519.
    In this paper, we prove the following:Theorem. Let M be a rosy dependent theory and letp,pbe non-þ-forking extensions ofp∈Switha0a1; assume thatp∪pis consistent and thata0,a1start a þ-independent indiscernible sequence. Thenp∪pis a non-þ-forking extension ofp.We also provide an example to show that the result is not true without assuming NIP.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark