Mekler s construction and generalized stability
|
|
- Maurice Stevens
- 5 years ago
- Views:
Transcription
1 Mekler s construction and generalized stability Artem Chernikov UCLA Automorphism Groups, Differential Galois Theory and Model Theory Barcelona, June 26, 2017
2 Joint work with Nadja Hempel (UCLA).
3 Mekler s construction Let p > 2 be prime. Let T be any theory in a finite relational language. [Mekler 81] A uniform construction of a group G (M) for every M = T, a theory T of all groups {G (M) : M = T } and an interpretation Γ of T in T s.t.: Idea: T is a theory of nilpotent groups of class 2 and of exponent p, if G = T, then M = T s.t. G (M) G, For M, N = T, M N G (M) G (N ), Γ (G (M)) = M. Bi-interpret M with a nice graph C. Define a group G (C) generated freely by the vertices of C, imposing that two generators commute they are connected by an edge in C. This kind of coding of graphs is known in probabilistic group theory, recursion theory, etc.
4 What model-theoretic properties are preserved? This is not a bi-interpretation (e.g., the resulting group is never ω-categorical), however some model-theoretic tameness properties are known to be preserved. [Mekler 81] For any cardinal κ, Th (M) is κ-stable Th (G (M)) is κ-stable. [Baudisch, Pentzel 02] Th (M) is simple Th (G (M)) is simple. [Baudisch 02] Assuming stability, Th (M) is CM-trivial Th (G (M)) is CM-trivial. We investigate what further properties from Shelah s classification are preserved.
5 k-dependent theories We fix a complete theory T in a language L. For k 1 we define: Definition [Shelah] A formula φ (x; y 1,..., y k ) is k-dependent if there are no infinite sets A i = {a i,j : j ω} M yi, i {1,..., k} in a model M of T such that A = n i=1 A i is shattered by φ, where A shattered means: for any s ω k, there is some b s M x s.t. M = φ (b s ; a 1,j1,..., a k,jk ) (j 1,..., j k ) s. T is k-dependent if all formulas are k-dependent. T is strictly k-dependent if it is k-dependent, but not (k 1)-dependent. T is 1-dependent T is NIP. 1-dependent 2-dependent... as witnessed by e.g. the theory of the random k-hypergraph.
6 k-dependent fields? Problem. Are there strictly k-dependent fields, for k > 1? Conjecture. There are no simple strictly k-dependent fields, for k > 1. [Hempel 15] Let K be an infinite field. 1. If Th (K) is k-dependent, then K is Artin-Schreier closed. 2. If K is a PAC field which is not separably closed, then Th (K) is not k-dependent for any k ω. (2) is due to Parigot for k = 1, and if K is pseudofinite, by Beyarslan K interprets the random k-hypergraph for all k ω.
7 k-dependent groups Let T be a theory and G a type-definable group (over ), and A M a small subset. Let GA 00 be the minimal type-definable over A subgroup of G of bounded index. Fact T is NIP = GA 00 = G 00 for all small A. Example Let G := ω F p. Let M := (G, F p, 0, +, ) with the bilinear form (a i ) (b i ) = i a ib i from G to F p. Then G is 2-dependent and GA 00 = { g G : a A g a = 0} gets smaller when enlarging A. Fact [Shelah] Let T be 2-dependent. Then for a suitable cardinal κ, if M M is κ-saturated and B < κ, then GM B 00 = G M 00 G 00 some A M, A < κ. This can be viewed as a trace of modularity. A B for
8 Mekler s construction preserves k-dependence No examples of strictly k-dependent groups for k > 2 were known. Theorem [C., Hempel 17] For any k ω, Th (M) k-dependent Th (G (M)) is k-dependent. Applying Mekler s construction to the random k-hypergraph, we get: Corollary For every k ω, there is a strictly k-dependent pure group G k (moreover, Th (G k ) simple by Baudisch).
9 A proof for NIP, 1 For a complete theory T, its stability spectrum is the function f T (κ) := sup { S 1 (M) : M = T, M = κ}. ded (κ) := sup { I : I is a linear order with a dense subset of size κ}. Fact [Shelah] Let the language of T be countable. 1. If T is NIP, then f T (κ) (ded κ) ℵ 0 for all infinite cardinals κ. 2. If T has IP, then f T (κ) = 2 κ for all infinite cardinals κ. Assuming GCH, ded κ = 2 κ for all κ. On the other hand: [Mitchell] For every cardinal κ with cf (κ) > ℵ 0, there is a forcing extension of the model of ZFC such that (ded κ) ℵ 0 < 2 κ.
10 A proof for NIP, 2 The actual result in the original paper of Mekler is: Fact f Th(G(M)) (κ) f Th(M) (κ) + ℵ 0 for all infinite cardinals κ. Hence if Th (M) is NIP, then f Th(G(M)) (κ) (ded κ) ℵ 0 for all κ, in all models of ZFC. Combining with Mitchell and using Schoenfield s absoluteness, Th (G (M)) is NIP. Admittedly this is somewhat esoteric, and more importantly doesn t generalize to k > 1.
11 Characterization of k-dependence We want a formula-free characterization of k-dependence (in Th (G (M)) we understand automorphisms, but not formulas). Let κ := T +. Fact T is NIP for every ( -)indiscernible sequence (a i : i κ) and b of finite tuples in M, there is some α κ such that (a i : i > α) is indiscernible over b. What is the analogue for k-dependence?
12 Generalized indiscernibles T is a theory in a language L, M = T. Definition Let I be an L 0 -structure. Say that ā = (a i : i I ), with a i a tuple in M, is I -indiscernible over C M if for all i 1,..., i n and j 1,..., j n from I : qftp L0 (i 1,..., i n ) = qftp L0 (j 1,..., j n ) = tp L (a i1,..., a in /C) = tp L (a j1,..., a jn /C). For L 0 -structures I, J, say that (b j : j J) is based on (a i : i I ) over C if for any finite set of L (C)-formulas and any (j 0,..., j n ) from J there is some (i 1,..., i n ) from I s.t. qftp L0 (j 1,..., j n ) = qftp L0 (i 1,..., i n ) and tp (b j1,..., b jn ) = tp (a i1,..., a in ). We say that I -indiscernibles exist if for any ā indexed by I there is an I -indiscernible based on it.
13 Connection to structural Ramsey theory Implicitly used by Shelah already in the classification book, made explicit by Scow and others. Definition Let K be a class of finite L 0 -structures. For A, B K, let ( B A) be the set of all A B s.t. A = A. K is Ramsey if for any A, B K and k ω there is some C K s.t. for any coloring f : ( ) C A k, there is some B ( C B) s.t. f ( ) B A is constant. Classical Ramsey theorem the class of finite linear orders is Ramsey. Fact Let K be a Fraïssé class, and let I be its limit. If K is Ramsey, then I -indiscernibles exist.
14 Ordered random hypergraph indiscernibles Fact [Nesétril, Rödl 77, 83] For any k ω, the class of all finite ordered k-hypergraphs is Ramsey. Fix k ω. Modifying their proof, we have existence of G-indiscernibles for G = (P 1,..., P k, R (x 1,..., x k ), <) the ordered k-partite random hypergraph (where P 1 <... < P k ). Let O = (P 1,..., P k, <) denote the reduct of G. Of course, (a g : g G) is O-indiscernible /C implies it is G-indiscernible /C. Clarifying Shelah, Fact [C., Palacin, Takeuchi 14] TFAE: 1. T is k-dependent. 2. For any (a g : g G) and b, with a g, b finite tuples in M, if (a g : g G) is G-indiscernible over b and O-indiscernible (over ), then it is O-indiscernible over b.
15 Mekler s construction in more detail, 1 A graph (binary, symmetric, irreflexive relation) C is nice if: a b, a b c (R (a, c) R (b, c)), no triangles or squares. Fact Any structure in a finite relational language is bi-interpretable with a nice graph. Let G = Th (G (C)), where G (C) is generated freely by the vertices of C, and two generators commute they are connected by an edge in Cs. We consider the following -definable equivalence relations on G, each refining the previous one: g h C G (g) = C G (h), g h r ω, c Z (G) s.t. g = h r c. g Z h gz (G) = hz (G).
16 Mekler s construction in more detail, 2 g G is of type q if q-many -classes in [g]. g is isolated if [g] = [g] Z. G can be partitioned into the following -definable set: non-isolated elements of type 1 type 1 ν, isolated elements of type 1 type 1 ι, elements of type p, elements of type p 1. For every g G of type p, the elements of G commuting with it are: elements -equaivalent to g, an element b of type 1 ν together with the elements -equivalent to b. Such a b is called a handle of g, and is definable from g up to -equivalence.
17 Mekler s construction in more detail, 3 Definition A set X G is a transversal if X = X ν X p X ι, where: 1. X ν : representatives for each -class of elements of type 1 ν in G; 2. X p : representatives of -classes of proper (i.e. not a product of any elements of type 1 ν ) elements of type p, maximal with the property that if Y X p is a finite set of elements with the same handle, then Y is independent modulo the subgroup generated by all elements of type 1 ν and Z (G); 3. X ι : representatives of -classes of proper elements of type 1 ι, maximal independent modulo the subgroup generated by all elements of types 1 ν and p in G, together with Z (G).
18 Mekler s construction in more detail, 4 C = (V, R) is interpreted in G as Γ (G): V ( = {g G ) : g is of type 1 ν, g / Z (G)} /, [g], [h] R g, h commute. For X a transversal of G, Γ (X ν ) is isomorphic to C. Let G = Th (G (C)) and X a transversal of G. There is a subgroup (elementary abelian p-group) H of Z (G) s.t. G = X H. There is some canonicity about this choice: X = G for any transversal X of G.
19 Mekler s construction in more detail, summarizing For any partial transversal X and any linearly independent over G subset H of Z (G), we can find a transversal X X and a maximal set H H s.t. G = X H. Lemma. Both conditions on X and H are type-definable. If Y, Z X and h : Y Z is a bijection respecting the 1 ν -, p-, and 1 ι -parts and the handles, and tp Γ (Y ν ) = tp Γ (h (Y ν )), then tp G (Y ) = tp G (h (Y )). Moreover, assuming saturation, h extends to an automorphism of G by gluing it with any automorphism of H.
20 Sketch of the proof, 1 Let G = Th (G (M)) be a monster model, and φ (x; y 1,..., y k ) not k-dependent. Choose a transversal X and H Z (G) s.t. G = X H. Compactness: a very large witness (a g : g G) to the failure of k-dependence, shattered by φ. For cardinality reasons, may assume a g = t ( x g, h g ) for some L G -term t and x g from X and h g from H. Can close under handles and, changing the formula, replace the original shattered set by ( x g h g : g G ). Using type-definability of partial transversals, etc. and existence of G-indiscernibles, can assume ( x g h g : g G ) is O-indiscernible (possibly changing the transversal to some X, H ). As ( x g h g : g G ) is shattered, can choose b = s ( ȳ, k ) G with ȳ X, k H s.t. φ (b; y 1,..., y k ) cuts out exactly the edge relation of the random k-hypergraph G.
21 Sketch of the proof, 2 Using existence of G-indiscernibles again, can assume that ( xg h g : g G ) is G-indiscernible over b (needs some argument, replacing X, H by some X, H ). Using that Th ( X ) and Th ( H ) are k-dependent by assumption (hence G-indiscernibility collapses to O-indiscernibility in them by the characterization above), can build an automorphism of G (glueing separate automorphisms of X and H together by the lemma above) σ such that: for some finite tuples of indices ḡ, h of the same type in O, but not in G, σ fixes b and sends ( x g hg : g ḡ ) to ( xh h h : h h ). contradiction to the choice of b.
22 Other results and directions Theorem [C., Hempel 17] Th (M) is NTP 2 Th (G (M)) is NTP 2. Problem. Are there pseudofinite strictly k-dependent groups? Are there ω-categorical strictly k-dependent groups?
I-Indexed Indiscernible Sets and Trees
1 / 20 I-Indexed Indiscernible Sets and Trees Lynn Scow Vassar College Harvard/MIT Logic Seminar December 3, 2013 2 / 20 Outline 1 background 2 the modeling property 3 a dictionary theorem 3 / 20 order
More informationFields and model-theoretic classification, 2
Fields and model-theoretic classification, 2 Artem Chernikov UCLA Model Theory conference Stellenbosch, South Africa, Jan 11 2017 NIP Definition Let T be a complete first-order theory in a language L.
More informationTame definable topological dynamics
Tame definable topological dynamics Artem Chernikov (Paris 7) Géométrie et Théorie des Modèles, 4 Oct 2013, ENS, Paris Joint work with Pierre Simon, continues previous work with Anand Pillay and Pierre
More informationVC-dimension in model theory and other subjects
VC-dimension in model theory and other subjects Artem Chernikov (Paris 7 / MSRI, Berkeley) UCLA, 2 May 2014 VC-dimension Let F be a family of subsets of a set X. VC-dimension Let F be a family of subsets
More informationApplications of model theory in extremal graph combinatorics
Applications of model theory in extremal graph combinatorics Artem Chernikov (IMJ-PRG, UCLA) Logic Colloquium Helsinki, August 4, 2015 Szemerédi regularity lemma Theorem [E. Szemerédi, 1975] Every large
More informationDisjoint n-amalgamation
October 13, 2015 Varieties of background theme: the role of infinitary logic Goals 1 study n- toward 1 existence/ of atomic models in uncountable cardinals. 2 0-1-laws 2 History, aec, and Neo-stability
More informationModel Theory and Forking Independence
Model Theory and Forking Independence Gabriel Conant UIC UIC Graduate Student Colloquium April 22, 2013 Gabriel Conant (UIC) Model Theory and Forking Independence April 22, 2013 1 / 24 Types We fix a first
More informationMODEL THEORY OF GROUPS (MATH 223M, UCLA, SPRING 2018)
MODEL THEORY OF GROUPS (MATH 223M, UCLA, SPRING 2018) ARTEM CHERNIKOV Lecture notes in progress. All comments and corrections are very welcome. Last update: May 21, 2018 Contents 1. Introduction 1 1.1.
More informationOn Kim-independence in NSOP 1 theories
On Kim-independence in NSOP 1 theories Itay Kaplan, HUJI Joint works with Nick Ramsey, Nick Ramsey and Saharon Shelah 06/07/2017, Model Theory, Będlewo, Poland 2/20 NSOP 1 Definition The formula ϕ(x; y)
More informationIndependence in tame abstract elementary classes
Independence in tame abstract elementary classes Sebastien Vasey Carnegie Mellon University January 11, 2015 Joint Mathematics Meeting AMS-ASL Special Session on Beyond First-Order Model Theory San Antonio,
More informationMarch 3, The large and small in model theory: What are the amalgamation spectra of. infinitary classes? John T. Baldwin
large and large and March 3, 2015 Characterizing cardinals by L ω1,ω large and L ω1,ω satisfies downward Lowenheim Skolem to ℵ 0 for sentences. It does not satisfy upward Lowenheim Skolem. Definition sentence
More informationMore Model Theory Notes
More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any
More informationWhat is the right type-space? Humboldt University. July 5, John T. Baldwin. Which Stone Space? July 5, Tameness.
Goals The fundamental notion of a Stone space is delicate for infinitary logic. I will describe several possibilities. There will be a quiz. Infinitary Logic and Omitting Types Key Insight (Chang, Lopez-Escobar)
More informationω-stable Theories: Introduction
ω-stable Theories: Introduction 1 ω - Stable/Totally Transcendental Theories Throughout let T be a complete theory in a countable language L having infinite models. For an L-structure M and A M let Sn
More informationThe Vaught Conjecture Do uncountable models count?
The Vaught Conjecture Do uncountable models count? John T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago May 22, 2005 1 Is the Vaught Conjecture model
More informationProperly forking formulas in Urysohn spaces
Properly forking formulas in Urysohn spaces Gabriel Conant University of Notre Dame gconant@nd.edu March 4, 2016 Abstract In this informal note, we demonstrate the existence of forking and nondividing
More informationSimple homogeneous structures
Department of Mathematics Uppsala University Logic Colloquium, 3-8 August 2015, Helsinki Introduction Homogeneous structures have interesting properties from a model theoretic point of view. They also
More informationIntroduction to Model Theory
Introduction to Model Theory Jouko Väänänen 1,2 1 Department of Mathematics and Statistics, University of Helsinki 2 Institute for Logic, Language and Computation, University of Amsterdam Beijing, June
More informationHence C has VC-dimension d iff. π C (d) = 2 d. (4) C has VC-density l if there exists K R such that, for all
1. Computational Learning Abstract. I discuss the basics of computational learning theory, including concept classes, VC-dimension, and VC-density. Next, I touch on the VC-Theorem, ɛ-nets, and the (p,
More informationFORCING WITH SEQUENCES OF MODELS OF TWO TYPES
FORCING WITH SEQUENCES OF MODELS OF TWO TYPES ITAY NEEMAN Abstract. We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work
More informationDefinably amenable groups in NIP
Definably amenable groups in NIP Artem Chernikov (Paris 7) Lyon, 21 Nov 2013 Joint work with Pierre Simon. Setting T is a complete first-order theory in a language L, countable for simplicity. M = T a
More informationTEST GROUPS FOR WHITEHEAD GROUPS
TEST GROUPS FOR WHITEHEAD GROUPS PAUL C. EKLOF, LÁSZLÓ FUCHS, AND SAHARON SHELAH Abstract. We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More informationINTRODUCTION TO GEOMETRIC STABILITY
INTRODUCTION TO GEOMETRIC STABILITY ARTEM CHERNIKOV Lecture notes for the IMS Graduate Summer School in Logic, National University of Singapore, Jun 2017. The material is based on a number of sources including:
More informationMATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. II - Model Theory - H. Jerome Keisler
ATHEATCS: CONCEPTS, AND FOUNDATONS Vol. - odel Theory - H. Jerome Keisler ODEL THEORY H. Jerome Keisler Department of athematics, University of Wisconsin, adison Wisconsin U.S.A. Keywords: adapted probability
More informationStrong theories, burden, and weight
Strong theories, burden, and weight Hans Adler 13th March 2007 Abstract We introduce the notion of the burden of a partial type in a complete first-order theory and call a theory strong if all types have
More informationD, such that f(u) = f(v) whenever u = v, has a multiplicative refinement g : [λ] <ℵ 0
Maryanthe Malliaris and Saharon Shelah. Cofinality spectrum problems in model theory, set theory and general topology. J. Amer. Math. Soc., vol. 29 (2016), pp. 237-297. Maryanthe Malliaris and Saharon
More informationWinter School on Galois Theory Luxembourg, February INTRODUCTION TO PROFINITE GROUPS Luis Ribes Carleton University, Ottawa, Canada
Winter School on alois Theory Luxembourg, 15-24 February 2012 INTRODUCTION TO PROFINITE ROUPS Luis Ribes Carleton University, Ottawa, Canada LECTURE 2 2.1 ENERATORS OF A PROFINITE ROUP 2.2 FREE PRO-C ROUPS
More informationDependent Fields have no Artin-Schreier Extensions
have no Artin-Schreier Extensions La Roche-en-Ardenne Itay Kaplan Joint work with Thomas Scanlon Hebrew University of Jerusalem and Université Claude Bernard Lyon 1 21 April 2008 In [5], Macintyre showed
More informationFINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS
FINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS ARTEM CHERNIKOV 1. Intro Motivated by connections with computational complexity (mostly a part of computer scientice today).
More informationSome algebraic properties of. compact topological groups
Some algebraic properties of compact topological groups 1 Compact topological groups: examples connected: S 1, circle group. SO(3, R), rotation group not connected: Every finite group, with the discrete
More informationStable embeddedness and N IP
Stable embeddedness and N IP Anand Pillay University of Leeds January 14, 2010 Abstract We give some sufficient conditions for a predicate P in a complete theory T to be stably embedded. Let P be P with
More informationLECTURE NOTES ON FORKING
LECTURE NOTES ON FORKING ARTEM CHERNIKOV Part 1. Preliminaries, model-theoretic notions of smallness, preindependence relations 1. Lecture 1 1.1. Types. Most of the time we fix a complete countable first-order
More informationGroups in stable and simple theories
Groups in stable and simple theories Dugald Macpherson, School of Mathematics, University of Leeds, Leeds LS2 9JT,UK April 7, 2010 These are sketch notes for my lecture on the MALOA Introductory Day of
More informationLecture 11: Minimal types
MODEL THEORY OF ARITHMETIC Lecture 11: Minimal types Tin Lok Wong 17 December, 2014 Uniform extension operators are used to construct models with nice structural properties Thus, one has a very simple
More informationLADDER INDEX OF GROUPS. Kazuhiro ISHIKAWA, Hiroshi TANAKA and Katsumi TANAKA
Math. J. Okayama Univ. 44(2002), 37 41 LADDER INDEX OF GROUPS Kazuhiro ISHIKAWA, Hiroshi TANAKA and Katsumi TANAKA 1. Stability In 1969, Shelah distinguished stable and unstable theory in [S]. He introduced
More informationClassifying classes of structures in model theory
Classifying classes of structures in model theory Saharon Shelah The Hebrew University of Jerusalem, Israel, and Rutgers University, NJ, USA ECM 2012 Saharon Shelah (HUJI and Rutgers) Classifying classes
More information20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.
20 Definition 20.1. A set α is an ordinal iff: (i) α is transitive; and (ii) α is linearly ordered by. Example 20.2. (a) Each natural number n is an ordinal. (b) ω is an ordinal. (a) ω {ω} is an ordinal.
More informationDistinct Volume Subsets: The Uncountable Case
Distinct Volume Subsets: The Uncountable Case Douglas Ulrich 1 William Gasarch 2 1 University of California, Irvine ds ulrich@hotmail.com 2 University of Maryland at College Park gasarch@cs.umd.edu July
More informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
More informationGROUPS DEFINABLE IN O-MINIMAL STRUCTURES
GROUPS DEFINABLE IN O-MINIMAL STRUCTURES PANTELIS E. ELEFTHERIOU Abstract. In this series of lectures, we will a) introduce the basics of o- minimality, b) describe the manifold topology of groups definable
More informationForking and Dividing in Random Graphs
Forking and Dividing in Random Graphs Gabriel Conant UIC Graduate Student Conference in Logic University of Notre Dame April 28-29, 2012 Gabriel Conant (UIC) Forking and Dividing in Random Graphs April
More informationRINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS
RINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS JACOB LOJEWSKI AND GREG OMAN Abstract. Let G be a nontrivial group, and assume that G = H for every nontrivial subgroup H of G. It is a simple matter to prove
More informationSuccessive cardinals with the tree property
UCLA March 3, 2014 A classical theorem Theorem (König Infinity Lemma) Every infinite finitely branching tree has an infinite path. Definitions A tree is set T together with an ordering < T which is wellfounded,
More informationMorley s Proof. Winnipeg June 3, 2007
Modern Model Theory Begins Theorem (Morley 1965) If a countable first order theory is categorical in one uncountable cardinal it is categorical in all uncountable cardinals. Outline 1 2 3 SELF-CONSCIOUS
More informationAutomorphism Groups of Homogeneous Structures
Automorphism Groups of Homogeneous Structures Andrés Villaveces - Universidad Nacional de Colombia - Bogotá Arctic Set Theory Workshop 3 - Kilpisjärvi - January 2017 Contents Reconstructing models The
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationContinuous and Borel Dynamics of Countable Borel Equivalence Relations
Continuous and Borel Dynamics of Countable Borel Equivalence Relations S. Jackson (joint with S. Gao, E. Krohne, and B. Seward) Department of Mathematics University of North Texas June 9, 2015 BLAST 2015,
More informationQuotient Numerical Semigroups (work in progress)
Quotient Numerical Semigroups (work in progress) Vítor Hugo Fernandes FCT-UNL/CAUL (joint work with Manuel Delgado) February 5, 2010 Iberian meeting on numerical semigroups Granada 2010 2010.02.03-05 (Universidad
More informationThe choice of ω 1 and combinatorics at ℵ ω
The choice of ω 1 and combinatorics at ℵ ω Spencer Unger UCLA October 19, 2013 Outline Combinatorial properties Theorems using supercompactness Bringing results down to ℵ ω Some new theorems A sketch of
More informationARTEM CHERNIKOV AND SERGEI STARCHENKO
A NOTE ON THE ERDŐS-HAJNAL PROPERTY FOR STABLE GRAPHS arxiv:1504.08252v2 [math.lo] 11 Apr 2016 ARTEM CHERNIKOV AND SERGEI STARCHENKO Abstract. In this short note we provide a relatively simple proof of
More informationTallness and Level by Level Equivalence and Inequivalence
Tallness and Level by Level Equivalence and Inequivalence Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationModel-theoretic distality and incidence combinatorics
Model-theoretic distality and incidence combinatorics Artem Chernikov UCLA Model Theory and Combinatorics workshop IHP, Paris, France Jan 29, 2018 Intro I will discuss generalizations of various results
More informationtp(c/a) tp(c/ab) T h(m M ) is assumed in the background.
Model Theory II. 80824 22.10.2006-22.01-2007 (not: 17.12) Time: The first meeting will be on SUNDAY, OCT. 22, 10-12, room 209. We will try to make this time change permanent. Please write ehud@math.huji.ac.il
More informationThe universal triangle-free graph has finite big Ramsey degrees
The universal triangle-free graph has finite big Ramsey degrees Natasha Dobrinen University of Denver AMS-ASL Special Session on Set Theory, Logic and Ramsey Theory, JMM 2018 Dobrinen big Ramsey degrees
More informationThe rise and fall of uncountable models
Chris Laskowski University of Maryland 2 nd Vaught s conjecture conference UC-Berkeley 2 June, 2015 Recall: Every counterexample Φ to Vaught s Conjecture is scattered. Recall: Every counterexample Φ to
More informationVC-DENSITY FOR TREES
VC-DENSITY FOR TREES ANTON BOBKOV Abstract. We show that for the theory of infinite trees we have vc(n) = n for all n. VC density was introduced in [1] by Aschenbrenner, Dolich, Haskell, MacPherson, and
More informationPROPER FORCING REMASTERED
PROPER FORCING REMASTERED BOBAN VELIČKOVIĆ AND GIORGIO VENTURI Abstract. We present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications:
More informationPosets, homomorphisms, and homogeneity
Posets, homomorphisms, and homogeneity Peter J. Cameron p.j.cameron@qmul.ac.uk Dedicated to Jarik Nešetřil on his sixtieth birthday HAPPY BIRTHDAY JARIK! Summary Jarik Nešetřil has made deep contributions
More informationIntroduction. Itaï Ben-Yaacov C. Ward Henson. September American Institute of Mathematics Workshop. Continuous logic Continuous model theory
Itaï Ben-Yaacov C. Ward Henson American Institute of Mathematics Workshop September 2006 Outline Continuous logic 1 Continuous logic 2 The metric on S n (T ) Origins Continuous logic Many classes of (complete)
More informationMeasures in model theory
Measures in model theory Anand Pillay University of Leeds Logic and Set Theory, Chennai, August 2010 Introduction I I will discuss the growing use and role of measures in pure model theory, with an emphasis
More informationITERATING ALONG A PRIKRY SEQUENCE
ITERATING ALONG A PRIKRY SEQUENCE SPENCER UNGER Abstract. In this paper we introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from
More informationRamsey theory of homogeneous structures
Ramsey theory of homogeneous structures Natasha Dobrinen University of Denver Notre Dame Logic Seminar September 4, 2018 Dobrinen big Ramsey degrees University of Denver 1 / 79 Ramsey s Theorem for Pairs
More informationCHAINS OF SATURATED MODELS IN AECS
CHAINS OF SATURATED ODELS IN AECS WILL BONEY AND SEBASTIEN VASEY Abstract. We study when a union of saturated models is saturated in the framework of tame abstract elementary classes (AECs) with amalgamation.
More informationOn n-dependence arxiv: v1 [math.lo] 1 Nov 2014
On n-dependence arxiv:1411.0120v1 [math.lo] 1 Nov 2014 Artem Chernikov Daniel Palacin Kota Takeuchi Abstract In this note we develop and clarify some of the basic combinatorial properties of the new notion
More informationWhat is... Fraissé construction?
What is... Fraissé construction? Artem Chernikov Humboldt Universität zu Berlin / Berlin Mathematical School What is... seminar at FU Berlin, 30 January 2009 Let M be some countable structure in a fixed
More informationCompact complex manifolds with the DOP and other properties.
Compact complex manifolds with the DOP and other properties. Anand Pillay Dept. Mathematics Univ. Illinois at Urbana-Champaign Thomas Scanlon Dept. Mathematics University of California at Berkeley July
More informationIntroduction to Model Theory
Introduction to Model Theory Charles Steinhorn, Vassar College Katrin Tent, University of Münster CIRM, January 8, 2018 The three lectures Introduction to basic model theory Focus on Definability More
More informationMore on invariant types in NIP theories
More on invariant types in NIP theories Pierre Simon June 22, 2013 This note is not intended for publication in its present form. I wrote it to be used as a reference for other papers (mainly [CPS13])
More informationA NOTE ON THE EIGHTFOLD WAY
A NOTE ON THE EIGHTFOLD WAY THOMAS GILTON AND JOHN KRUEGER Abstract. Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an ω 2 -Aronszajn tree, the ω 1 -approachability
More informationAN AXIOMATIC FORMATION THAT IS NOT A VARIETY
AN AXIOMATIC FORMATION THAT IS NOT A VARIETY KEITH A. KEARNES Abstract. We show that any variety of groups that contains a finite nonsolvable group contains an axiomatic formation that is not a subvariety.
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/54851 holds various files of this Leiden University dissertation Author: Stanojkovski, M. Title: Intense automorphisms of finite groups Issue Date: 2017-09-05
More informationChapter 25 Finite Simple Groups. Chapter 25 Finite Simple Groups
Historical Background Definition A group is simple if it has no nontrivial proper normal subgroup. The definition was proposed by Galois; he showed that A n is simple for n 5 in 1831. It is an important
More informationJune 28, 2007, Warsaw
University of Illinois at Chicago June 28, 2007, Warsaw Topics 1 2 3 4 5 6 Two Goals Tell Explore the notion of Class as a way of examining extensions of first order logic Ask Does the work on generalized
More informationTHE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES
THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES NATASHA DOBRINEN Abstract. The universal homogeneous triangle-free graph H 3 has finite big Ramsey degrees : For each finite triangle-free
More informationCanonical models for fragments of the Axiom of Choice
Canonical models for fragments of the Axiom of Choice Paul Larson Miami University Jindřich Zapletal University of Florida October 31, 2016 Abstract We develop technology for investigation of natural forcing
More informationModel Theory of Fields with Virtually Free Group Actions
Model Theory of Fields with Virtually Free Group Actions Özlem Beyarslan joint work with Piotr Kowalski Boğaziçi University Istanbul, Turkey 29 March 2018 Ö. Beyarslan, P. Kowalski Model Theory of V.F
More informationSOME USES OF SET THEORY IN ALGEBRA. Stanford Logic Seminar February 10, 2009
SOME USES OF SET THEORY IN ALGEBRA Stanford Logic Seminar February 10, 2009 Plan I. The Whitehead Problem early history II. Compactness and Incompactness III. Deconstruction P. Eklof and A. Mekler, Almost
More informationAmalgamation and the finite model property
Amalgamation and the finite model property Alex Kruckman University of California, Berkeley March 25, 2015 Alex Kruckman (UC Berkeley) Amalgamation and the FMP March 25, 2015 1 / 16 The motivating phenomenon
More informationNon-Elementary Classes 2007
October 7, 2007 Two Directions 1 2 Acknowledgements I will interpret or misinterpret the works of many people with only vague and non-uniform specific acknowledgments. The end or the beginning? Shelah
More informationGroups of Prime Power Order with Derived Subgroup of Prime Order
Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationCOMPLETE NORMALITY AND COUNTABLE COMPACTNESS
Topology Proceedings Vol 17, 1992 COMPLETE NORMALITY AND COUNTABLE COMPACTNESS PETER J. NYIKOS, BORIS SHAPIROVSKIĬ, ZOLTÁN SZENTMIKLÓSSY AND BOBAN VELIČKOVIĆ One of the classical separation axioms of topology
More informationForking and dividing in dependent theories
Forking and dividing in dependent theories (and NTP 2 in there) Artem Chernikov 1 joint work with Itay Kaplan 2 1 Humboldt Universität zu Berlin / Université Claude Bernard Lyon 1 2 Hebrew University of
More informationRamsey theory and the geometry of Banach spaces
Ramsey theory and the geometry of Banach spaces Pandelis Dodos University of Athens Maresias (São Paulo), August 25 29, 2014 1.a. The Hales Jewett theorem The following result is due to Hales & Jewett
More informationType decompositions in NIP theories
École Normale Supérieure, Paris Logic Colloquium 2012, Manchester Definition A formula φ(x; y) has the independence property if one can find some infinite set B such that for every C B, there is y C such
More informationStable embeddedness and N IP
Stable embeddedness and N IP arxiv:1001.0515v1 [math.lo] 4 Jan 2010 Anand Pillay University of Leeds January 4, 2010 Abstract We give some sufficient conditions for a predicate P in a complete theory T
More informationHrushovski s Amalgamation Construction
Amalgamation Frank O Wagner Institut Camille Jordan Université Claude Bernard France 1 August Plan 1 2 3 In 1986, Ehud Hrushovski modified construction of a universial homogeneous countable relational
More informationNotas de Aula Grupos Profinitos. Martino Garonzi. Universidade de Brasília. Primeiro semestre 2018
Notas de Aula Grupos Profinitos Martino Garonzi Universidade de Brasília Primeiro semestre 2018 1 Le risposte uccidono le domande. 2 Contents 1 Topology 4 2 Profinite spaces 6 3 Topological groups 10 4
More informationThe extent of the failure of Ramsey s theorem at successor cardinals
The extent of the failure of Ramsey s theorem at successor cardinals 2012 North American Annual Meeting of the ASL University of Wisconsin Madison 31-March-2012 Assaf Rinot University of Toronto Mississauga
More informationThree Red Herrings around Vaught s Conjecture
Three Red Herrings around Vaught s Conjecture John T. Baldwin University of Illinois at Chicago Sy D. Friedman KGRC Michael C. Laskowski University of Maryland Martin Koerwien KGRC November 21, 2013 Abstract
More informationGOOD FRAMES IN THE HART-SHELAH EXAMPLE
GOOD FRAMES IN THE HART-SHELAH EXAMPLE WILL BONEY AND SEBASTIEN VASEY Abstract. For a fixed natural number n 1, the Hart-Shelah example is an abstract elementary class (AEC) with amalgamation that is categorical
More informationAlmost Galois ω-stable classes
Almost Galois ω-stable classes John T. Baldwin Paul B. Larson Saharon Shelah March 11, 2015 Abstract Theorem. Suppose that k = (K, k ) is an ℵ 0-presentable abstract elementary class with Löwenheim-Skolem
More informationGROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS
GROUPS WITH UNBOUNDED POTENTIAL AUTOMORPHISM TOWER HEIGHTS PHILIPP LÜCKE Abstract. We show that it is consistent with the axioms of ZFC that there exists an infinite centreless group G with the property
More informationCHAPTER III NORMAL SERIES
CHAPTER III NORMAL SERIES 1. Normal Series A group is called simple if it has no nontrivial, proper, normal subgroups. The only abelian simple groups are cyclic groups of prime order, but some authors
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationOctober 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.
October 12, 2010 Sacks Dicta... the central notions of model theory are absolute absoluteness, unlike cardinality, is a logical concept. That is why model theory does not founder on that rock of undecidability,
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationFoundations. September 4, Foundations. A Model Theoretic Perspective. John T. Baldwin. sociology. Thesis I. Thesis II. A Concept Analysis
September 4, 2009 Outline 1 2 3 4 A Data point for PBPL Practice based philosophy of logic Are model theorists logicians? They do not analyze methods of reasoning. A Data point for PBPL Practice based
More informationLöwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)
Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1
More information