Results for 'Predag Tanović'

18 found
Order:
  1.  6
    Stable Theories Without Dense Forking Chains.Bernhard Herwig, James G. Loveys, Anand Pillay, Predag Tanović & O. Wagner - 1992 - Archive for Mathematical Logic 31 (5):297-303.
    We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  11
    Stationarily Ordered Types and the Number of Countable Models.Slavko Moconja & Predrag Tanović - 2020 - Annals of Pure and Applied Logic 171 (3):102765.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  20
    On Constants and the Strict Order Property.Predrag Tanović - 2005 - Archive for Mathematical Logic 45 (4):423-430.
    Let T be a complete, countable, first-order theory with a finite number of countable models. Assuming that dcl(∅) is infinite we show that T has the strict order property.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  10
    Generically Stable Regular Types.Predrag Tanović - 2015 - Journal of Symbolic Logic 80 (1):308-321.
  5.  20
    Types Directed by Constants.Predrag Tanović - 2010 - Annals of Pure and Applied Logic 161 (7):944-955.
    Let T be a complete, countable, first-order theory having infinite models. We introduce types directed by constants, and prove that their presence in a model of T guaranties the maximal number of non-isomorphic countable models : I=2.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Countable Models of Trivial Theories Which Admit Finite Coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
    We prove: Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has 2 ℵ 0 nonisomorphic countable models. Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  22
    Minimal First-Order Structures.Predrag Tanović - 2011 - Annals of Pure and Applied Logic 162 (11):948-957.
    We prove a dichotomy theorem for minimal structures and use it to prove that the number of non-isomorphic countable elementary extensions of an arbitrary countable, infinite first-order structure is infinite.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. A Definable Continuous Rank for Nonmultidimensional Superstable Theories.Ambar Chowdhury, James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (3):967-984.
  9. On Kueker's Conjecture.Predrag Tanović - 2012 - Journal of Symbolic Logic 77 (4):1245-1256.
    We prove that a Kueker theory with infinite dcl(Ø) does not have the strict order property and that strongly minimal types are dense: any non-algebraic formula is contained in a strongly minimal type.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  10.  5
    Theories with Constants and Three Countable Models.Predrag Tanović - 2007 - Archive for Mathematical Logic 46 (5-6):517-527.
    We prove that a countable, complete, first-order theory with infinite dcl( $ \theta $ ) and precisely three non-isomorphic countable models interprets a variant of Ehrenfeucht’s or Peretyatkin’s example.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  9
    Asymmetric RK-Minimal Types.Predrag Tanović - 2010 - Archive for Mathematical Logic 49 (3):367-377.
    We consider semi-isolation on the locus of a strongly non-isolated, RK-minimal type in a small theory, and we prove that its asymmetry (as a binary relation) is caused by a specific form of the strict order property: the partial definability of semi-isolation.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  3
    Non-Isolated Types in Stable Theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.
    We introduce notions of strong and eventual strong non-isolation for types in countable, stable theories. For T superstable or small stable we prove a dichotomy theorem: a regular type over a finite domain is either eventually strongly non-isolated or is non-orthogonal to a NENI type . As an application we obtain the upper bound for Lascar’s rank of a superstable theory which is one-based or trivial, and has fewer than 20 non-isomorphic countable models.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  25
    Simple Groups and the Number of Countable Models.Predrag Tanović - 2013 - Archive for Mathematical Logic 52 (7-8):779-791.
    Let T be a complete, superstable theory with fewer than ${2^{\aleph_{0}}}$ countable models. Assuming that generic types of infinite, simple groups definable in T eq are sufficiently non-isolated we prove that ω ω is the strict upper bound for the Lascar rank of T.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  14.  18
    Asymmetric Regular Types.Slavko Moconja & Predrag Tanović - 2015 - Annals of Pure and Applied Logic 166 (2):93-120.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  15.  12
    A Note on a-Prime Models.Bradd Hart, Željko Sokolović & Predrag Tanovic - 1999 - Journal of Symbolic Logic 64 (4):1557-1562.
    We answer a question of Cassidy and Kolchin about the universality of the constrained closure of a differential field by working in a larger category of models.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  16.  6
    Semi-Isolation and the Strict Order Property.Sergey Sudoplatov & Predrag Tanović - 2015 - Notre Dame Journal of Formal Logic 56 (4):555-572.
    We study semi-isolation as a binary relation on the locus of a complete type and prove that—under some additional assumptions—it induces the strict order property.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  17.  6
    On Definability of Types of Finite Cantor-Bendixson Rank.Predrag Tanovic - 2011 - Mathematical Logic Quarterly 57 (3):256-260.
    We prove that every type of finite Cantor-Bendixson rank over a model of a first-order theory without the strict order property is definable and has a unique nonforking extension to a global type. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18.  2
    A Note on Countable Models of 1-Based Theories.Predrag Tanovic - 2002 - Archive for Mathematical Logic 41 (7):669-671.
    We prove that the existence of a nonisolated type having a finite domain and which is orthogonal to øin a 1-based theory implies that it has a continuum nonisomorphic countable models.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark