Switch to: References

Add citations

You must login to add citations.
  1. Differentially algebraic group chunks.Anand Pillay - 1990 - Journal of Symbolic Logic 55 (3):1138-1142.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Thorn Forking, Weak Normality, and Theories with Selectors.Daniel Max Hoffmann & Anand Pillay - 2023 - Journal of Symbolic Logic 88 (4):1354-1366.
    We discuss the role of weakly normal formulas in the theory of thorn forking, as part of a commentary on the paper [5]. We also give a counterexample to Corollary 4.2 from that paper, and in the process discuss “theories with selectors.”.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)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  
  • 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  
  • 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  
  • Equational theories of fields.Amador Martin-Pizarro & Martin Ziegler - 2020 - Journal of Symbolic Logic 85 (2):828-851.
    A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability. We show the equationality of the theory of proper extensions of algebraically closed fields and of the theory of separably closed fields of arbitrary imperfection degree.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)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   2 citations  
  • The notion of independence in categories of algebraic structures, part II: S-minimal extensions.Gabriel Srour - 1988 - Annals of Pure and Applied Logic 39 (1):55-73.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • 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  
  • The indiscernible topology: A mock zariski topology.Markus Junker & Daniel Lascar - 2001 - Journal of Mathematical Logic 1 (01):99-124.
    We associate with every first order structure [Formula: see text] a family of invariant, locally Noetherian topologies. The structure is almost determined by the topologies, and properties of the structure are reflected by topological properties. We study these topologies in particular for stable structures. In nice cases, we get a behaviour similar to the Zariski topology in algebraically closed fields.
    Download  
     
    Export citation  
     
    Bookmark   4 citations