Switch to: References

Add citations

You must login to add citations.
  1. On definability of types and relative stability.Viktor Verbovskiy - 2019 - Mathematical Logic Quarterly 65 (3):332-346.
    In this paper, we consider the question of definability of types in non‐stable theories. In order to do this we introduce a notion of a relatively stable theory: a theory is stable up to Δ if any Δ‐type over a model has few extensions up to complete types. We prove that an n‐type over a model of a theory that is stable up to Δ is definable if and only if its Δ‐part is definable.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • 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  
  • 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  
    		•
  • On Interpretability of Almost Linear Orderings.Akito Tsuboi & Kentaro Wakai - 1998 - Notre Dame Journal of Formal Logic 39 (3):325-331.
    In this paper we define the notion of -linearity for and discuss interpretability (and noninterpretability) of -linear orders in structures and theories.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
    		•