5 found
Order:
  1.  21
    Stationarily ordered types and the number of countable models.Slavko Moconja & Predrag Tanović - 2020 - Annals of Pure and Applied Logic 171 (3):102765.
    We introduce the notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the former is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary relation on elements realizing stationarily ordered types, is an equivalence relation and that each stationarily ordered type in a model determines some order-type as an invariant of the model. We study weak and forking non-orthogonality of stationarily ordered types, show that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  8
    Around rubin’s “theories of linear order”.Predrag Tanović, Slavko Moconja & Dejan Ilić - 2020 - Journal of Symbolic Logic 85 (4):1403-1426.
    Let $\mathcal M=$ be a linearly ordered first-order structure and T its complete theory. We investigate conditions for T that could guarantee that $\mathcal M$ is not much more complex than some colored orders. Motivated by Rubin’s work [5], we label three conditions expressing properties of types of T and/or automorphisms of models of T. We prove several results which indicate the “geometric” simplicity of definable sets in models of theories satisfying these conditions. For example, we prove that the strongest (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  27
    Asymmetric regular types.Slavko Moconja & Predrag Tanović - 2015 - Annals of Pure and Applied Logic 166 (2):93-120.
  4.  10
    Invariant measures in simple and in small theories.Artem Chernikov, Ehud Hrushovski, Alex Kruckman, Krzysztof Krupiński, Slavko Moconja, Anand Pillay & Nicholas Ramsey - 2023 - Journal of Mathematical Logic 23 (2).
    We give examples of (i) a simple theory with a formula (with parameters) which does not fork over [Formula: see text] but has [Formula: see text]-measure 0 for every automorphism invariant Keisler measure [Formula: see text] and (ii) a definable group [Formula: see text] in a simple theory such that [Formula: see text] is not definably amenable, i.e. there is no translation invariant Keisler measure on [Formula: see text]. We also discuss paradoxical decompositions both in the setting of discrete groups (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  8
    Does weak quasi-o-minimality behave better than weak o-minimality?Slavko Moconja & Predrag Tanović - 2021 - Archive for Mathematical Logic 61 (1):81-103.
    We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also prove that weak quasi-o-minimality of a theory with respect to one definable linear order implies weak quasi-o-minimality with respect to any other such order.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark