97 found
Order:
  1.  34
    Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
  2.  29
    Lovely pairs of models.Itay Ben-Yaacov, Anand Pillay & Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 122 (1-3):235-261.
    We introduce the notion of a lovely pair of models of a simple theory T, generalizing Poizat's “belles paires” of models of a stable theory and the third author's “generic pairs” of models of an SU-rank 1 theory. We characterize when a saturated model of the theory TP of lovely pairs is a lovely pair , finding an analog of the nonfinite cover property for simple theories. We show that, under these hypotheses, TP is also simple, and we study forking (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  3.  17
    [Omnibus Review].Anand Pillay - 1984 - Journal of Symbolic Logic 49 (1):317-321.
  4.  49
    Type-definability, compact lie groups, and o-minimality.Anand Pillay - 2004 - Journal of Mathematical Logic 4 (02):147-162.
    We study type-definable subgroups of small index in definable groups, and the structure on the quotient, in first order structures. We raise some conjectures in the case where the ambient structure is o-minimal. The gist is that in this o-minimal case, any definable group G should have a smallest type-definable subgroup of bounded index, and that the quotient, when equipped with the logic topology, should be a compact Lie group of the "right" dimension. I give positive answers to the conjectures (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  5. First order topological structures and theories.Anand Pillay - 1987 - Journal of Symbolic Logic 52 (3):763-778.
    In this paper we introduce the notion of a first order topological structure, and consider various possible conditions on the complexity of the definable sets in such a structure, drawing several consequences thereof.Our aim is to develop, for a restricted class of unstable theories, results analogous to those for stable theories. The “material basis” for such an endeavor is the analogy between the field of real numbers and the field of complex numbers, the former being a “nicely behaved” unstable structure (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  6.  10
    On Groups with Definable F_-Generics Definable in _P-Adically Closed Fields.Anand Pillay & Y. A. O. Ningyuan - 2023 - Journal of Symbolic Logic 88 (4):1334-1353.
    The aim of this paper is to develop the theory of groups definable in the p-adic field ${{\mathbb {Q}}_p}$, with “definable f-generics” in the sense of an ambient saturated elementary extension of ${{\mathbb {Q}}_p}$. We call such groups definable f-generic groups.So, by a “definable f-generic” or $dfg$ group we mean a definable group in a saturated model with a global f-generic type which is definable over a small model. In the present context the group is definable over ${{\mathbb {Q}}_p}$, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  37
    On compactifications and the topological dynamics of definable groups.Jakub Gismatullin, Davide Penazzi & Anand Pillay - 2014 - Annals of Pure and Applied Logic 165 (2):552-562.
    For G a group definable in some structure M, we define notions of “definable” compactification of G and “definable” action of G on a compact space X , where the latter is under a definability of types assumption on M. We describe the universal definable compactification of G as View the MathML source and the universal definable G-ambit as the type space SG. We also point out the existence and uniqueness of “universal minimal definable G-flows”, and discuss issues of amenability (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8.  13
    Remarks on the NIP in a model.Karim Khanaki & Anand Pillay - 2018 - Mathematical Logic Quarterly 64 (6):429-434.
    We define the notion has the NIP (not the independence property) in A, where A is a subset of a model, and give some equivalences by translating results from function theory. We also discuss the number of coheirs when A is not necessarily countable, and revisit the notion “ has the NOP (not the order property) in a model M”.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  22
    Topological dynamics and definable groups.Anand Pillay - 2013 - Journal of Symbolic Logic 78 (2):657-666.
    We give a commentary on Newelski's suggestion or conjecture [8] that topological dynamics, in the sense of Ellis [3], applied to the action of a definable group $G(M)$ on its “external type space” $S_{G,\textit{ext}}(M)$, can explain, account for, or give rise to, the quotient $G/G^{00}$, at least for suitable groups in NIP theories. We give a positive answer for measure-stable (or $fsg$) groups in NIP theories. As part of our analysis we show the existence of “externally definable” generics of $G(M)$ (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  10.  29
    A note on groups definable in the p -adic field.Anand Pillay & Ningyuan Yao - 2019 - Archive for Mathematical Logic 58 (7-8):1029-1034.
    It is known Hrushovski and Pillay that a group G definable in the field \ of p-adic numbers is definably locally isomorphic to the group \\) of p-adic points of a algebraic group H over \. We observe here that if H is commutative then G is commutative-by-finite. This shows in particular that any one-dimensional group G definable in \ is commutative-by-finite. This result extends to groups definable in p-adically closed fields. We prove our results in the more general context (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  31
    Superrosy dependent groups having finitely satisfiable generics.Clifton Ealy, Krzysztof Krupiński & Anand Pillay - 2008 - Annals of Pure and Applied Logic 151 (1):1-21.
    We develop a basic theory of rosy groups and we study groups of small Uþ-rank satisfying NIP and having finitely satisfiable generics: Uþ-rank 1 implies that the group is abelian-by-finite, Uþ-rank 2 implies that the group is solvable-by-finite, Uþ-rank 2, and not being nilpotent-by-finite implies the existence of an interpretable algebraically closed field.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  12. Some remarks on definable equivalence relations in o-minimal structures.Anand Pillay - 1986 - Journal of Symbolic Logic 51 (3):709-714.
  13.  34
    From stability to simplicity.Byunghan Kim & Anand Pillay - 1998 - Bulletin of Symbolic Logic 4 (1):17-36.
    §1. Introduction. In this report we wish to describe recent work on a class of first order theories first introduced by Shelah in [32], the simple theories. Major progress was made in the first author's doctoral thesis [17]. We will give a survey of this, as well as further works by the authors and others.The class of simple theories includes stable theories, but also many more, such as the theory of the random graph. Moreover, many of the theories of particular (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  14.  64
    The prospects for mathematical logic in the twenty-first century.Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore - 2001 - Bulletin of Symbolic Logic 7 (2):169-196.
    The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  15.  32
    Additive reducts of real closed fields.David Marker, Ya'acov Peterzil & Anand Pillay - 1992 - Journal of Symbolic Logic 57 (1):109-117.
  16.  63
    Corps et chirurgie.Anand Pillay & Bruno Poizat - 1995 - Journal of Symbolic Logic 60 (2):528-533.
    Les corps algébriquement clos, réels clos et pseudo-finis n'ont, pour chaque entier n, qu'un nombre fini d'extensions de degré n; nous montrons qu'ils partagent cette propriété avec tous les corps qui, comme eux, satisfont une propriété très rudimentaire de préservation de la dimension, de nature modèle-théorique. Ce résultat est atteint en montrant qu'une certaine action du groupe GLn d'un tel corps n'a qu'un nombre fini d'orbites. /// La korpoj algebre fermataj, reale fermataj kaj pseudofinataj ne havas, pri ciu integro n, (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  17.  32
    A descending chain condition for groups definable in o -minimal structures.Alessandro Berarducci, Margarita Otero, Yaa’cov Peterzil & Anand Pillay - 2005 - Annals of Pure and Applied Logic 134 (2):303-313.
    We prove that if G is a group definable in a saturated o-minimal structure, then G has no infinite descending chain of type-definable subgroups of bounded index. Equivalently, G has a smallest type-definable subgroup G00 of bounded index and G/G00 equipped with the “logic topology” is a compact Lie group. These results give partial answers to some conjectures of the fourth author.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  18.  29
    The definable multiplicity property and generic automorphisms.Hirotaka Kikyo & Anand Pillay - 2000 - Annals of Pure and Applied Logic 106 (1-3):263-273.
    Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T{“σ is an automorphism”} is an elementary class if and only if T has the definable multiplicity property, as long as T is a finite cover of a strongly minimal theory which does have the definable multiplicity property. We obtain cleaner results working with several automorphisms, and prove: the class of existentially closed models of T{“σi is an automorphism”: i=1,2} is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  19.  21
    A note on CM-Triviality and the geometry of forking.Anand Pillay - 2000 - Journal of Symbolic Logic 65 (1):474-480.
    CM-triviality of a stable theory is a notion introduced by Hrushovski [1]. The importance of this property is first that it holds of Hrushovski's new non 1-based strongly minimal sets, and second that it is still quite a restrictive property, and forbids the existence of definable fields or simple groups (see [2]). In [5], Frank Wagner posed some questions aboutCM-triviality, asking in particular whether a structure of finite rank, which is “coordinatized” byCM-trivial types of rank 1, is itselfCM-trivial. (Actually Wagner (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  20.  12
    Stable theories, pseudoplanes and the number of countable models.Anand Pillay - 1989 - Annals of Pure and Applied Logic 43 (2):147-160.
    We prove that if T is a stable theory with only a finite number of countable models, then T contains a type-definable pseudoplane. We also show that for any stable theory T either T contains a type-definable pseudoplane or T is weakly normal.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  21.  38
    Closed sets and chain conditions in stable theories.Anand Pillay & Gabriel Srour - 1984 - Journal of Symbolic Logic 49 (4):1350-1362.
  22.  9
    Discrete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Annals of Pure and Applied Logic 34 (3):275-289.
  23.  30
    On fields definable inQ p.Anand Pillay - 1989 - Archive for Mathematical Logic 29 (1):1-7.
    We prove that any field definable in (Q p, +, ·) is definably isomorphic to a finite extension ofQ p.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  24.  83
    The geometry of forking and groups of finite Morley rank.Anand Pillay - 1995 - Journal of Symbolic Logic 60 (4):1251-1259.
    The notion of CM-triviality was introduced by Hrushovski, who showed that his new strongly minimal sets have this property. Recently Baudisch has shown that his new ω 1 -categorical group has this property. Here we show that any group of finite Morley rank definable in a CM-trivial theory is nilpotent-by-finite, or equivalently no simple group of finite Morley rank can be definable in a CM-trivial theory.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  25.  31
    Borel equivalence relations and Lascar strong types.Krzysztof Krupiński, Anand Pillay & Sławomir Solecki - 2013 - Journal of Mathematical Logic 13 (2):1350008.
    The "space" of Lascar strong types, on some sort and relative to a given complete theory T, is in general not a compact Hausdorff topological space. We have at least three aims in this paper. The first is to show that spaces of Lascar strong types, as well as other related spaces and objects such as the Lascar group Gal L of T, have well-defined Borel cardinalities. The second is to compute the Borel cardinalities of the known examples as well (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  26.  35
    A free pseudospace.Andreas Baudisch & Anand Pillay - 2000 - Journal of Symbolic Logic 65 (1):443-460.
    In this paper we construct a non-CM-trivial stable theory in which no infinite field is interpretable. In fact our theory will also be trivial and ω-stable, but of infinite Morley rank. A long term aim would be to find a nonCM-trivial theory which has finite Morley rank (or is even strongly minimal) and does not interpret a field. The construction in this paper is direct, and is a “3-dimensional” version of the free pseudoplane. In a sense we are cheating: the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  27.  25
    Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
    We continue the study of simple theories begun in [3] and [5]. We first find the right analogue of definability of types. We then develop the theory of generic types and stabilizers for groups definable in simple theories. The general ideology is that the role of formulas (or definability) in stable theories is replaced by partial types (or ∞-definability) in simple theories.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  28.  14
    Forking, normalization and canonical bases.Anand Pillay - 1986 - Annals of Pure and Applied Logic 32:61-81.
  29.  38
    PAS d'imaginaires dans l'infini!Anand Pillay & Bruno Poizat - 1987 - Journal of Symbolic Logic 52 (2):400-403.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  30.  57
    On PAC and Bounded Substructures of a Stable Structure.Anand Pillay & Dominika Polkowska - 2006 - Journal of Symbolic Logic 71 (2):460 - 472.
    We introduce and study the notions of a PAC-substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [10]. We give precise definitions and equivalences, saying what it means for properties such as PAC to be first order, study some examples (such as differentially closed fields) in detail, relate the material to generic automorphisms, and generalize a "descent theorem" for pseudo-algebraically closed fields to the stable context. We also point out that the elementary invariants of pseudo-algebraically (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  31.  10
    On maximal stable quotients of definable groups in nip theories.Mike Haskel & Anand Pillay - 2018 - Journal of Symbolic Logic 83 (1):117-122.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  20
    Generic stability and stability.Hans Adler, Enrique Casanovas & Anand Pillay - 2014 - Journal of Symbolic Logic 79 (1):179-185.
  33.  21
    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  
  34.  64
    A Note on Generically Stable Measures and fsg Groups.Ehud Hrushovski, Anand Pillay & Pierre Simon - 2012 - Notre Dame Journal of Formal Logic 53 (4):599-605.
    We prove (Proposition 2.1) that if $\mu$ is a generically stable measure in an NIP (no independence property) theory, and $\mu(\phi(x,b))=0$ for all $b$ , then for some $n$ , $\mu^{(n)}(\exists y(\phi(x_{1},y)\wedge \cdots \wedge\phi(x_{n},y)))=0$ . As a consequence we show (Proposition 3.2) that if $G$ is a definable group with fsg (finitely satisfiable generics) in an NIP theory, and $X$ is a definable subset of $G$ , then $X$ is generic if and only if every translate of $X$ does not (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  37
    Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.
  36.  14
    Domination and regularity.Anand Pillay - 2020 - Bulletin of Symbolic Logic 26 (2):103-117.
    We discuss the close relationship between structural theorems in stability theory, and graph regularity theorems.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  30
    Dimension theory and homogeneity for elementary extensions of a model.Anand Pillay - 1982 - Journal of Symbolic Logic 47 (1):147-160.
  38. Coordinatisation and canonical bases in simple theories.Bradd Hart, Byunghan Kim & Anand Pillay - 2000 - Journal of Symbolic Logic 65 (1):293-309.
    In this paper we discuss several generalization of theorems from stability theory to simple theories. Cherlin and Hrushovski, in [2] develop a substitute for canonical bases in finite rank, ω-categorical supersimple theories. Motivated by methods there, we prove the existence of canonical bases (in a suitable sense) for types in any simple theory. This is done in Section 2. In general these canonical bases will (as far as we know) exist only as “hyperimaginaries”, namely objects of the forma/Ewhereais a possibly (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  39.  33
    Connected components of definable groups, and o-minimality II.Annalisa Conversano & Anand Pillay - 2015 - Annals of Pure and Applied Logic 166 (7-8):836-849.
  40.  11
    On Theories Having Three Countable Models.Koichiro Ikeda, Akito Tsuboi & Anand Pillay - 1998 - Mathematical Logic Quarterly 44 (2):161-166.
    A theory T is called almost [MATHEMATICAL SCRIPT CAPITAL N]0-categorical if for any pure types p1,…,pn there are only finitely many pure types which extend p1 ∪…∪pn. It is shown that if T is an almost [MATHEMATICAL SCRIPT CAPITAL N]0-categorical theory with I = 3, then a dense linear ordering is interpretable in T.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  49
    Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
    Let T be a complete O-minimal theory in a language L. We first give an elementary proof of the result (due to Marker and Steinhorn) that all types over Dedekind complete models of T are definable. Let L * be L together with a unary predicate P. Let T * be the L * -theory of all pairs (N, M), where M is a Dedekind complete model of T and N is an |M| + -saturated elementary extension of N (and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  42.  14
    Non-totally transcendental unidimensional theories.Anand Pillay & Philipp Rothmaler - 1990 - Archive for Mathematical Logic 30 (2):93-111.
  43.  40
    On Lascar rank and Morley rank of definable groups in differentially closed fields.Anand Pillay & Wai Yan Pong - 2002 - Journal of Symbolic Logic 67 (3):1189-1196.
    Morley rank and Lascar rank are equal on generic types of definable groups in differentially closed fields with finitely many commuting derivations.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  44. Number of countable models.Anand Pillay - 1978 - Journal of Symbolic Logic 43 (3):492-496.
  45.  12
    Imaginaries in pairs of algebraically closed fields.Anand Pillay - 2007 - Annals of Pure and Applied Logic 146 (1):13-20.
    We consider the theory P of pairs F (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  46.  8
    More on Galois Cohomology, Definability and Differential Algebraic Groups.Omar León Sánchez, David Meretzky & Anand Pillay - forthcoming - Journal of Symbolic Logic:1-19.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47. Theories with exactly three countable models and theories with algebraic prime models.Anand Pillay - 1980 - Journal of Symbolic Logic 45 (2):302-310.
  48.  18
    Remarks on unimodularity.Charlotte Kestner & Anand Pillay - 2011 - Journal of Symbolic Logic 76 (4):1453-1458.
    We clarify and correct some statements and results in the literature concerning unimodularity in the sense of Hrushovski [7], and measurability in the sense of Macpherson and Steinhorn [8], pointing out in particular that the two notions coincide for strongly minimal structures and that another property from [7] is strictly weaker, as well as "completing" Elwes' proof [5] that measurability implies 1-basedness for stable theories.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  18
    Classification theory over a predicate. I.Anand Pillay & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (4):361-376.
  50.  32
    Forking and fundamental order in simple theories.Daniel Lascar & Anand Pillay - 1999 - Journal of Symbolic Logic 64 (3):1155-1158.
    We give a characterisation of forking in the context of simple theories in terms of the fundamental order.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 97