On Kim-independence in NSOP 1 theories
|
|
- Teresa Cross
- 5 years ago
- Views:
Transcription
1 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 2/20 NSOP 1 Definition The formula ϕ(x; y) has SOP 1 if there is a collection of tuples a η η 2 <ω so that { } For all η 2 ω, ϕ(x, a η α ) α < ω is consistent. For all η 2 <ω, if ν η 0, then {ϕ(x, a ν ), ϕ(x, a η 1 )} is inconsistent. T is NSOP 1 if no formula in it has SOP 1.
3 3/20 Alternative definition The following definition seems more accessible. Definition The formula ϕ(x; y) has an SOP 1 array if there is a collection of pairs c i, d i i < ω and some k < ω so that ϕ (x, c i ) i < ω is consistent. ϕ (x, d i ) i < ω is k-inconsistent. c i c,d<i d i for all i < ω. Fact T is NSOP 1 iff no formula ϕ (x, y) has an SOP 1 -array.
4 4/20 The place of NSOP 1 in the universe Every simple theory is NSOP 1, and every NSOP 1 theory is NTP 1, as illustrated in Gabe Conant s beautiful diagram A map of the universe
5 SOP 1 was defined by Džamonja and Shelah (2004), and was later studied by Usvyatsov and Shelah where a first example of a non-simple NSOP 1 was introduced* (2008). More recently, in their paper on model-theoretic tree properties (2016), Chernikov and Ramsey provided more information. They proved a version of the Kim-Pillay characterization for NSOP 1. Namely, if there is an independence relation satisfying certain properties, then the theory is NSOP 1. This characterization can be used to provide many natural examples of NSOP 1 -theories. 5/20
6 6/20 The Chernikov-Ramsey characterization Theorem (Chernkiov-Ramsey) Assume there is an Aut(C)-invariant ternary relation on small subsets of the monster which satisfies the following properties, for an arbitrary M = T and arbitrary tuples from C. Strong finite character: if a b, then there is a formula M ϕ(x, b, m) tp(a/bm) such that for any a = ϕ(x, b, m), a M b. Existence over models: M = T implies a M for any a. M Monotonicity: aa M bb = a M b. Symmetry: a M b b M a. The independence theorem: a b, a M M c, b M c and a M a implies there is a with a Mb a, a Mc a and a M bc. Then T is NSOP 1.
7 7/20 Examples of NSOP 1 theories Here are some examples of non-simple NSOP 1 that were studied recently. 1. (Ramsey) The selector function: the model companion of the following theory. Two sorts, F and O. E is an equivalence relation on O, eval : F O O is a function such that eval (f, o) E o and if o 1 E o 2 then eval (f, o 1 ) = eval (f, o 2 ). 2. (Chernikov, Ramsey) Parametrized simple theory (T simple and is a Fraïssé limit of a universal class of finite relational language with no algebraicity, then add a new sort for generic copies of models of T ). 3. (Chernikov, Ramsey) ω-free PAC fields (i.e., PAC fields with Galois group ˆF ω, the free profinite group with ℵ 0 -generators. (Was extended to general Frobenius fields, essentially the same proof.)
8 8/20 Examples of NSOP 1 theories 4 (Kruckman, Ramsey) If T is a model complete NSOP 1 theory eliminating the quantifier, then the generic expansion of T by arbitrary constant, function, and relation symbols is still NSOP 1. (Exists by a Theorem of Winkler, 1975.) 5. (Kruckman, Ramsey) With the same assumption, T can be extended to an NSOP 1 -theory with Skolem functions. 6. (Chernikov, Ramsey) Vector spaces with a generic bilinear form (exist by Granger). 7. (d Elbée,...) Algebraically closed field of positive char. with a generic additive subgroup.
9 9/20 Kim independence To complete the picture, it is natural to try and find an independence relation satisfying the criterion of Chernikov-Ramsey. Definition We say that ϕ (x, b) Kim-divides over a model M if there is a global M-invariant type q tp (b/m) such that {ϕ (x, a i ) i < ω } is inconsistent when a i i < ω is a Morley sequence in q over M. In other words, this is saying that ϕ (x, b) divides but that moreover the sequence witnessing dividing is a Morley sequence generated by an invariant type (a 0 = q M, a 1 = q Ma0, etc.). This notion was suggested by Kim in his Banff talk in 2009, and is also related to Hrushovski s q-dividing and Shelah and Malliaris higher formula. Definition We say that ϕ (x, b) Kim-forks over M if it implies a finite disjunction of Kim-dividing formulas.
10 10/20 Kim s Lemma for Kim independence Lemma (NSOP 1 ) If ϕ (x, b) Kim-divides and q is any global invariant type containing tp (b/m), then {ϕ (x, a i ) i < ω } is inconsistent where a i i < ω is a Morley sequence generated by q. Corollary (NSOP 1 ) If ϕ (x, b) Kim-forks over M then it Kim-divides over M. However, this is not true for forking. Proof. By the alternative definition of NSOP 1 using SOP 1 arrays. Definition Write a K b for tp (a/mb) does not Kim-divide over M. M
11 Properties of Kim independence Theorem (NSOP 1 ) Kim-independence satisfies all the properties listed in the Ramsey-Chernikov criterion. Strong finite character: if a K b, then there is a formula M ϕ(x, b, m) tp(a/bm) such that for any a = ϕ(x, b, m), a K M b. Existence over models: M = T implies a K M for any a. M Monotonicity: aa K M bb = a K M b. Symmetry: a K M b b K M a. The independence theorem: a K b, a M K M c, b K M c and a M a implies there is a with a Mb a, a Mc a and a K M bc. 11/20
12 12/20 Tree Morley sequences The main tool in the proofs of all the nontrivial properties (symmetry and the independence theorem) was tree Morley sequences. These are sequences which are indexed by an infinite tree. They play a similar role to Morley sequences in simple theories. They can be defined to be of any height, but let me define the trees of height ω. Definition Let T ω be the set of functions f : [n, ω) ω with finite support. We put a tree order T ω by f g iff f g. We let f g = f m where m = min {n < ω f [m, ω) = g [m, ω)}. The n th level of the tree is the set P n = {f dom (f ) = [n, ω)}. We put a lexicographical order by f < lex g iff f g or f g P n+1 and f (n) < g (n). Let ζ n be the zero function with domain [n, ω).
13 An illustration of T ω 13/20
14 14/20 Tree Morley sequences Definition a η η T ω is called a Morley tree over M if: 1. It is indiscernible with respect to the language {, < lex,, len } where f len g iff f is lower than g in the tree. 2. For every n < ω, there is some global invariant type q over M such that a ζn+1 i i < ω is a Morley sequence generated by q. Definition A sequence a n n < ω is a Tree Morley sequence if there is a Morley tree as above such that a n = a ζn for all n. Remark: to construct tree Morley sequences in practice, one usually constructs a very tall tree, and then extract using Erdös-Rado.
15 15/20 Tree Morley sequences Theorem (NSOP 1 ) 1. If a i i < ω is a tree Morley sequence over M. Then ϕ (x, a 0 ) Kim-divides over M iff {ϕ (x, a i ) i < ω } is inconsistent. 2. If a i i < ω is a universal witness for Kim-dividing (if ϕ (x; a <n ) Kim-divides over M then the sequence of n-tuples from a i i < ω witness this), then a i i < ω is a Tree Morley sequence. 3. Tree Morley sequences exists: if a K M b and a M b then there is a tree Morley sequence starting with a, b. 4. If a i i < ω is a Morley sequence over M (i.e., an indiscernible sequence such that a i f M a <i), then a i i < ω is a tree Morley sequence, and in particular witnesses Kim-dividing.
16 Kim-independence and simple theories Theorem TFAE for an NSOP 1 -theory T : 1. T is simple. 2. K = f over models. 3. K satisfies base monotonicity over models. In particular we get a new proof of a (stronger result of Shelah that NTP 2 +NTP 1 =Simple). Corollary If T is NSOP 1 and NTP 2, then T is simple. Proof. It is known that in NTP 2, if ϕ (x, b) divides over M then it Kim-divides over M. Note: Transitivity fails. It is possible that ab K M c, a K M b but a K M bc. 16/20
17 17/20 Local character In my work with Ramsey, we proved a version of local character. Theorem (NSOP 1 ) If p S (M) then there is some N M of size 2 T over which p does not Kim-fork. In joint work with Shelah we were able to considerably improve this theorem.
18 18/20 The club filter Definition For a set X, a family of C countable subsets of X is called a club if it is closed (a countable union of elements from C is in C) and unbounded (every countable subset of X is contained in some member of C). The club filter is the filter of all clubs. A family of countable subsets of X is called stationary if it intersects every club. Fact The Club filter on X is generated by sets of the form C F where F is a collection of finitary functions on X and where C F is the set of all countable Y X closed under members of F. The definition of club and the fact generalize (in an appropriate way) to [X] κ instead of [X] ω.
19 19/20 The local character characterization Theorem TFAE for a theory T : 1. T is NSOP If p S (M) then for stationary many N M of size T, p does not Kim-divide over N. 3. If p S (M) then for club many N M of size T, p does not Kim-divide over N. 4. If p S (M) then there is a global extension q such that for are club many N M of size T, q does not Kim-fork over N. Note: the proof uses stationary logic where one is allowed to add quantifiers of the form (aas) ϕ (S) meaning that for club many sets S, ϕ (S) holds.
20 20/20 Thank you Thank you for your time!
Forking 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 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 informationarxiv: v2 [math.lo] 12 Feb 2018
LOCAL CHARACTER OF KI-INDEPENDENCE ITAY KAPLAN, NICHOLAS RASEY, AND SAHARON SHELAH arxiv:1707.02902v2 [math.lo] 12 Feb 2018 Abstract. We show that NSOP 1 theories are exactly the theories in which Kim-independence
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 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 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 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 informationWeight and measure in NIP theories
Weight and measure in NIP theories Anand Pillay University of Leeds September 18, 2011 Abstract We initiate an account of Shelah s notion of strong dependence in terms of generically stable measures, proving
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 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 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 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 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 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 informationIndependence Relations in Theories with the Tree Property. Gwyneth Fae Harrison-Shermoen
Independence Relations in Theories with the Tree Property by Gwyneth Fae Harrison-Shermoen A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in
More informationMekler s construction and generalized stability
Mekler s construction and generalized stability Artem Chernikov UCLA Automorphism Groups, Differential Galois Theory and Model Theory Barcelona, June 26, 2017 Joint work with Nadja Hempel (UCLA). Mekler
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 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 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 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 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 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 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 informationI-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 informationarxiv: v2 [math.lo] 3 Nov 2011
ON OMEGA-CATEGORICAL SIMPLE THEORIES arxiv:1102.3631v2 [math.lo] 3 Nov 2011 DANIEL PALACÍN Abstract. In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable
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 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 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 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 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 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 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 informationModel Theory and Combinatorics of Homogeneous Metric Spaces
Model Theory and Combinatorics of Homogeneous Metric Spaces by Gabriel Conant B.A. (Colgate University) 2008 M.S. (University of Illinois at Chicago) 2010 Thesis submitted in partial fulfillment of the
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 informationFORKING AND DIVIDING IN HENSON GRAPHS
FORKING AND DIVIDING IN HENSON GRAPHS GABRIEL ONANT arxiv:1401.1570v1 [math.lo] 8 Jan 2014 Abstract. For n 3, define T n to be the theory of the generic K n-free graph, where K n is the complete graph
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 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 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 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 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 informationarxiv:math.lo/ v1 28 Nov 2004
HILBERT SPACES WITH GENERIC GROUPS OF AUTOMORPHISMS arxiv:math.lo/0411625 v1 28 Nov 2004 ALEXANDER BERENSTEIN Abstract. Let G be a countable group. We proof that there is a model companion for the approximate
More informationTutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011
Tutorial 1.3: Combinatorial Set Theory Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011 I. Generalizing Ramsey s Theorem Our proof of Ramsey s Theorem for pairs was
More informationContinuum Harvard. April 11, Constructing Borel Models in the. Continuum Harvard. John T. Baldwin. University of Illinois at Chicago
April 11, 2013 Today s Topics 1 2 3 4 5 6 Pseudo-minimal 7 Further Applications Section 1: { Models in L ω1,ω L ω1,ω satisfies downward Löwenheim Skolem to ℵ 0 for sentences. It does not satisfy upward
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 informationComputability theory and uncountable structures
Sets and Computations, April 17 2015 Joint with Greg Igusa, Julia Knight and Antonio Montalbán Table of Contents 1 Generically presentable structures 2 3 1 Generically presentable structures 2 3 What phenomena
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 informationAN INTRODUCTION TO STABILITY THEORY
AN INTRODUCTION TO STABILITY THEORY DANIEL PALACÍN These lecture notes are a slightly extended version of my course on stability theory given at the Münster Model Theory Month in May of 2016. The course
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 informationGENERALIZED AMALGAMATION IN SIMPLE THEORIES AND CHARACTERIZATION OF DEPENDENCE IN NON-ELEMENTARY CLASSES
GENERALIZED AMALGAMATION IN SIMPLE THEORIES AND CHARACTERIZATION OF DEPENDENCE IN NON-ELEMENTARY CLASSES By Alexei Kolesnikov Submitted in partial fulfillment of the requirements for the degree of Doctor
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 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 informationTRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY
TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY John T. Baldwin Department of Mathematics University of Illinois at Chicago Chicago, IL 60680 Rami Grossberg Department of Mathematics Carnegie
More informationA trichotomy of countable, stable, unsuperstable theories
A trichotomy of countable, stable, unsuperstable theories Michael C. Laskowski Department of Mathematics University of Maryland S. Shelah Department of Mathematics Hebrew University of Jerusalem Department
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 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 informationA CONVERSATION BETWEEN MODEL THEORY AND GRAPH THEORY
A CONVERSATION BETWEEN MODEL THEORY AND GRAPH THEORY ISABELLA SCOTT Abstract. In general terms, Ramsey Theory studies the properties of structures that are preserved under taking partitions, and covers
More informationINDEPENDENCE RELATIONS IN RANDOMIZATIONS
INDEPENDENE RELATIONS IN RANDOMIZATIONS URI ANDREWS, ISAA GOLDBRING, AND H. JEROME KEISLER Abstract. The randomization of a complete first order theory T is the complete continuous theory T R with two
More informationDiamond, non-saturation, and weak square principles
Diamond, non-saturation, and weak square principles Logic Colloquium 2009 (European ASL summer meeting) 02-Aug-09, Sofia Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on successor
More informationarxiv: v1 [math.lo] 28 Mar 2015
MODEL-THEORETIC APPLICATIONS OF COFINALITY SPECTRUM PROBLEMS arxiv:1503.08338v1 [math.lo] 28 Mar 2015 M. MALLIARIS AND S. SHELAH Abstract. We apply the recently developed technology of cofinality spectrum
More informationSet Theory and Models of Arithmetic ALI ENAYAT. First European Set Theory Meeting
Set Theory and Models of Arithmetic ALI ENAYAT First European Set Theory Meeting Bedlewo, July 12, 2007 PA is finite set theory! There is an arithmetical formula E(x, y) that expresses the x-th digit of
More informationModel theory, algebraic dynamics and local fields
Model theory, algebraic dynamics and local fields Thomas Scanlon University of California, Berkeley 8 June 2010 Thomas Scanlon (University of California, Berkeley) Model theory, algebraic dynamics and
More informationCOHEIR IN AVERAGEABLE CLASSES
OHEIR IN AVERAGEABLE LASSES WILL BONEY This document serves as a supplement to Boney [Bon, Section 3], in particular to provide the details to Proposition 3.6. Familiarity with that paper and Boney and
More informationHrushovski s Fusion. A. Baudisch, A. Martin-Pizarro, M. Ziegler March 4, 2007
Hrushovski s Fusion A. Baudisch, A. Martin-Pizarro, M. Ziegler March 4, 2007 Abstract We present a detailed and simplified exposition of Hrushovki s fusion of two strongly minimal theories. 1 Introduction
More informationCategoricity in homogeneous complete metric spaces
Categoricity in homogeneous complete metric spaces Åsa Hirvonen and Tapani Hyttinen May 12, 2008 University of Helsinki, Department of Mathematics and Statistics, P.O. Box 68, 00014 University of Helsinki,
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 informationSUPPLEMENT TO DENSE PAIRS OF O-MINIMAL STRUCTURES BY LOU VAN DEN DRIES
SUPPLEMENT TO DENSE PIRS OF O-MINIML STRUCTURES BY LOU VN DEN DRIES LLEN GEHRET Introduction If in doubt, all notations and assumptions are with respect to [7]. Generally speaking, exercises are things
More informationModel theory, stability, applications
Model theory, stability, applications Anand Pillay University of Leeds June 6, 2013 Logic I Modern mathematical logic developed at the end of the 19th and beginning of 20th centuries with the so-called
More informationAN INTRODUCTION TO GEOMETRIC STABILITY THEORY
AN INTRODUCTION TO GEOMETRIC STABILITY THEORY SALMAN SIDDIQI Abstract. In this paper, we will introduce some of the most basic concepts in geometric stability theory, and attempt to state a dichotomy theorem
More informationCoarse Dimension and Pseudofinite Difference Fields
Coarse Dimension and Pseudofinite Difference Fields Tingxiang Zou PhD student at Institut Carmille Jordan, Université Lyon 1 Supervisor: Frank Wagner April 9, 2018 Difference Fields A Difference Field
More informationScott Sentences in Uncountable Structures
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 14 Scott Sentences in Uncountable Structures Brian Tyrrell Trinity College Dublin Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationTHE CHARACTERISTIC SEQUENCE OF A FIRST-ORDER FORMULA
THE CHARACTERISTIC SEQUENCE OF A FIRST-ORDER FORMULA M. E. MALLIARIS Abstract. For a first-order formula ϕ(x; y) we introduce and study the characteristic sequence P n : n < ω of hypergraphs defined by
More informationForcing Axioms and Inner Models of Set Theory
Forcing Axioms and Inner Models of Set Theory Boban Veličković Equipe de Logique Université de Paris 7 http://www.logique.jussieu.fr/ boban 15th Boise Extravaganza in Set Theory Boise State University,
More informationSMOOTHNESS OF BOUNDED INVARIANT EQUIVALENCE RELATIONS
SMOOTHNESS OF BOUNDED INVARIANT EQUIVALENCE RELATIONS KRZYSZTOF KRUPI SKI AND TOMASZ RZEPECKI Abstract. We generalise the main theorems from the paper The Borel cardinality of Lascar strong types by I.
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 informationStability Theory and its Variants
Model Theory, Algebra, and Geometry MSRI Publications Volume 39, 2000 Stability Theory and its Variants BRADD HART Abstract. Dimension theory plays a crucial technical role in stability theory and its
More informationEvery Linear Order Isomorphic to Its Cube is Isomorphic to Its Square
Every Linear Order Isomorphic to Its Cube is Isomorphic to Its Square Garrett Ervin University of California, Irvine May 21, 2016 We do not know so far any type α such that α = α 3 = α 2. W. Sierpiński,
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 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 informationAMENABILITY, DEFINABLE GROUPS, AND AUTOMORPHISM GROUPS
AMENABILITY, DEFINABLE GROUPS, AND AUTOMORPHISM GROUPS KRZYSZTOF KRUPI SKI AND ANAND PILLAY Abstract. We prove several theorems relating amenability of groups in various categories (discrete, denable,
More informationTHE METAMATHEMATICS OF RANDOM GRAPHS
THE METAMATHEMATICS OF RANDOM GRAPHS John T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago Abstract We explain and summarize the use of logic to provide
More informationA variant of Namba Forcing
A variant of Namba Forcing Moti Gitik School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Science Tel Aviv University Ramat Aviv 69978, Israel August 0, 009 Abstract Ronald Jensen
More informationOn NIP and invariant measures
On NIP and invariant measures Ehud Hrushovski Hebrew University of Jerusalem Anand Pillay University of Leeds December 3, 2010 Abstract We study forking, Lascar strong types, Keisler measures and definable
More informationSet Theory and Indiscernibles. Ali Enayat. IPM Logic Conference
Set Theory and Indiscernibles Ali Enayat IPM Logic Conference June 2007 LEIBNIZ S PRINCIPLE OF IDENTITY OF INDISCERNIBLES The principle of identity of indiscernibles, formulated by Leibniz (1686), states
More informationA DISCUSSION OF KEISLER S ORDER
A DISCUSSION OF KEISLER S ORDER ADELE PADGETT Abstract. In model theory, the complex numbers as an algebraically closed field are often given as an example of a simple, well-behaved mathematical structure,
More informationA Hanf number for saturation and omission: the superstable case
A Hanf number for saturation and omission: the superstable case John T. Baldwin University of Illinois at Chicago Saharon Shelah The Hebrew University of Jerusalem Rutgers University April 29, 2013 Abstract
More informationThe Rocky Romance of Model Theory and Set Theory University of Helsinki
The Rocky Romance of Model Theory and Set Theory University of Helsinki John T. Baldwin University of Illinois at Chicago June 3, 2016 John T. Baldwin University of Illinois at ChicagoThe Rocky Romance
More informationarxiv: v4 [math.lo] 3 Nov 2016
ON SUPERSTABLE EXPANSIONS OF FREE ABELIAN GROUPS DANIEL PALACÍN AND RIZOS SKLINOS arxiv:1405.0568v4 [math.lo] 3 Nov 2016 Abstract. We prove that (Z,+,0) has no proper superstable expansions of finite Lascar
More informationCOLLAPSING FUNCTIONS
COLLAPSING FUNCTIONS ERNEST SCHIMMERLING AND BOBAN VELICKOVIC Abstract. We define what it means for a function on ω 1 to be a collapsing function for λ and show that if there exists a collapsing function
More informationLARGE SCALE GEOMETRY OF AUTOMORPHISM GROUPS
LARGE SCALE GEOMETRY OF AUTOMORPHISM GROUPS CHRISTIAN ROSENDAL Contents 1. Introduction 1 1.1. Non-Archimedean Polish groups and large scale geometry 1 1.2. Main results 3 2. Orbital types formulation
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 informationAN INTRODUCTION TO EXCELLENT CLASSES INTRODUCTION
AN INTRODUCTION TO EXCELLENT CLASSES OLIVIER LESSMANN ABSTRACT. In this paper, we present Shelah s theory of excellence concluding with his categoricity theorem for the class of atomic models of a countable
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 informationOn NIP and invariant measures
arxiv:0710.2330v2 [math.lo] 29 Jan 2009 On NIP and invariant measures Ehud Hrushovski Hebrew University of Jerusalem January 28, 2009 Abstract Anand Pillay University of Leeds We study forking, Lascar
More informationERDŐS-RADO CLASSES WILL BONEY
ERDŐS-RADO CLASSES WILL BONEY Abstract. We amalgamate two generalizations of Ramsey s Theorem Ramsey classes and the Erdős-Rado Theorem into the notion of a combinatorial Erdős-Rado class. These classes
More informationOn the isometry group of the Urysohn space
On the isometry group of the Urysohn space Katrin Tent and Martin Ziegler March 22, 2012 Abstract We give a general criterion for the (bounded) simplicity of the automorphism groups of certain countable
More informationThe Rocky Romance of Model Theory and Set Theory
The Rocky Romance of Model Theory and Set Theory John T. Baldwin University of Illinois at Chicago Eilat meeeting in memory of Mati Rubin May 6, 2018 John T. Baldwin University of Illinois at ChicagoThe
More informationPCF THEORY AND CARDINAL INVARIANTS OF THE REALS
PCF THEORY AND CARDINAL INVARIANTS OF THE REALS LAJOS SOUKUP Abstract. The additivity spectrum ADD(I) of an ideal I P(I) is the set of all regular cardinals κ such that there is an increasing chain {A
More informationNIP THEORIES AND SHELAH S THEOREM
NIP THEORIES AND SHELAH S THEOREM These are the informal and expanded notes of a mini-course given in the Universidad Autónoma de Madrid, 29-30 of May 2018 (6 hours). The mini-course was given at the end
More informationCMPSCI 601: Tarski s Truth Definition Lecture 15. where
@ CMPSCI 601: Tarski s Truth Definition Lecture 15! "$#&%(') *+,-!".#/%0'!12 43 5 6 7 8:9 4; 9 9 < = 9 = or 5 6?>A@B!9 2 D for all C @B 9 CFE where ) CGE @B-HI LJKK MKK )HG if H ; C if H @ 1 > > > Fitch
More informationMORLEY S CATEGORICITY THEOREM
MORLEY S CATEGORICITY THEOREM NICK RAMSEY Abstract. A theory is called κ-categorical, or categorical in power κ, if it has one model up to isomorphism of cardinality κ. Morley s Categoricity Theorem states
More information