Order:
  1.  14
    Definability in Low Simple Theories.Ziv Shami - 2000 - Journal of Symbolic Logic 65 (4):1481-1490.
  2.  7
    Internality and Interpretable Automorphism Groups in Simple Theories.Ziv Shami - 2004 - Annals of Pure and Applied Logic 129 (1-3):149-162.
    The binding group theorem for stable theories is partially extended to the simple context. Some results concerning internality are proved. We also introduce a ‘small’ normal subgroup G0+ of the automorphism group and show that if p is Q-internal then it has a finite exponent and G/G0+ is interpretable.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  8
    On Kueker Simple Theories.Ziv Shami - 2005 - Journal of Symbolic Logic 70 (1):216 - 222.
    We show that a Kueker simple theory eliminates Ǝ∞ and densely interprets weakly minimal formulas. As part of the proof we generalize Hrushovski's dichotomy for almost complete formulas to simple theories. We conclude that in a unidimensional simple theory an almost-complete formula is either weakly minimal or trivially-almost-complete. We also observe that a small unidimensional simple theory is supersimple of finite SU-rank.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  63
    On the Type-Definability of the Binding Group in Simple Theories.Bradd Hart & Ziv Shami - 2005 - Journal of Symbolic Logic 70 (2):379 - 388.
    Let T be simple, work in Ceq over a boundedly closed set. Let p ∈ S(θ) be internal in a quasi-stably-embedded type-definable set Q (e.g., Q is definable or stably-embedded) and suppose (p, Q) is ACL-embedded in Q (see definitions below). Then Aut(p/Q) with its action on pC is type-definable in Ceq over θ. In particular, if p ∈ S(θ) is internal in a stably-embedded type-definable set Q, and pC υ Q is stably-embedded, then Aut(p/Q) is type-definable with its action (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  5.  2
    Coordinatisation by Binding Groups and Unidimensionality in Simple Theories.Ziv Shami - 2004 - Journal of Symbolic Logic 69 (4):1221 - 1242.
    In a simple theory with elimination of finitary hyperimaginaries if tp(a) is real and analysable over a definable set Q, then there exists a finite sequence ( $a_{i}|i \leq n^{*}$ ) $\subseteq dcl^{eq}$ (a) with $a_{n}*$ = a such that for every $i \leq n*$ , if $p_{i} = tp(a_{i}/{a_{i}|j < i}$ ) then $Aut(p_{i}/Q)$ is type-definable with its action on $p_{i}^{c}$ . A unidimensional simple theory eliminates the quantifier $\exists^{\infty}$ and either interprets (in $C^{eq}$ ) an infinite type-definable group (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  16
    On Uncountable Hypersimple Unidimensional Theories.Ziv Shami - 2014 - Archive for Mathematical Logic 53 (1-2):203-210.
  7.  16
    On the Binding Group in Simple Theories.Ziv Shami & Frank O. Wagner - 2002 - Journal of Symbolic Logic 67 (3):1016-1024.
    We show that if p is a real type which is almost internal in a formula φ in a simple theory, then there is a type p' interalgebraic with a finite tuple of realizations of p, which is generated over φ. Moreover, the group of elementary permutations of p' over all realizations of φ is type-definable.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  8.  11
    Invariant Version of Cardinality Quantifiers in Superstable Theories.Alexander Berenstein & Ziv Shami - 2006 - Notre Dame Journal of Formal Logic 47 (3):343-351.
    We generalize Shelah's analysis of cardinality quantifiers for a superstable theory from Chapter V of Classification Theory and the Number of Nonisomorphic Models. We start with a set of bounds for the cardinality of each formula in some general invariant family of formulas in a superstable theory (in Classification Theory, a uniform family of formulas is considered) and find a set of derived bounds for all formulas. The set of derived bounds is sharp: up to a technical restriction, every model (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  9.  1
    On Analyzability in the Forking Topology for Simple Theories.Ziv Shami - 2006 - Annals of Pure and Applied Logic 142 (1):115-124.
    We show that in a simple theory T in which the τf-topologies are closed under projections every type analyzable in a supersimple τf-open set has ordinal SU-rank. In particular, if in addition T is unidimensional, the existence of a supersimple unbounded τf-open set implies T is supersimple. We also introduce the notion of a standard τ-metric and show that for simple theories its completeness is equivalent to the compactness of the τ-topology.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark