Switch to: References

Add citations

You must login to add citations.
  1. Semi-Equational Theories.Artem Chernikov & Alex Mennen - forthcoming - Journal of Symbolic Logic:1-32.
    We introduce and study (weakly) semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong honest definitions; demonstrate that certain trees are semi-equational, while algebraically closed valued fields are not weakly semi-equational; and obtain a general criterion for weak semi-equationality of an expansion of a distal structure by a new predicate.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Superstable quasi-varieties.B. Hart & S. Starchenko - 1994 - Annals of Pure and Applied Logic 69 (1):53-71.
    We present a structure theorem for superstable quasi-varieties without DOP. We show that every algebra in such a quasi-variety weakly decomposes as the product of an affine algebra and a combinational algebra, that is, it is bi-interpretable with a two sorted structure where one sort is an affine algebra, the other sort is a combinatorial algebra and the only non-trivial polynomials between the two sorts are certain actions of the affine sort on the combinatorial sort.
    Download  
     
    Export citation  
     
    Bookmark  
  • The notion of independence in categories of algebraic structures, part III: equational classes.Gabriel Srour - 1990 - Annals of Pure and Applied Logic 47 (3):269-294.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A note on equational theories.Markus Junker - 2000 - Journal of Symbolic Logic 65 (4):1705-1712.
    Several attempts have been done to distinguish “positive” information in an arbitrary first order theory, i.e., to find a well behaved class of closed sets among the definable sets. In many cases, a definable set is said to be closed if its conjugates are sufficiently distinct from each other. Each such definition yields a class of theories, namely those where all definable sets are constructible, i.e., boolean combinations of closed sets. Here are some examples, ordered by strength:Weak normality describes a (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Comparing axiomatizations of free pseudospaces.Olaf Beyersdorff - 2009 - Archive for Mathematical Logic 48 (7):625-641.
    Independently and pursuing different aims, Hrushovski and Srour (On stable non-equational theories. Unpublished manuscript, 1989) and Baudisch and Pillay (J Symb Log 65(1):443–460, 2000) have introduced two free pseudospaces that generalize the well know concept of Lachlan’s free pseudoplane. In this paper we investigate the relationship between these free pseudospaces, proving in particular, that the pseudospace of Baudisch and Pillay is a reduct of the pseudospace of Hrushovski and Srour.
    Download  
     
    Export citation  
     
    Bookmark