Properly ergodic random structures
|
|
- Roland Toby Wood
- 5 years ago
- Views:
Transcription
1 Properly ergodic random structures Alex Kruckman University of California, Berkeley June 11, 2015 Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
2 Properly ergodic random structures Joint work with Nate Ackerman, Cameron Freer, and Rehana Patel. What is a random structure? I ll start with two examples. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
3 Example 1: The random graph L = {E}. Build a graph with domain ω, probabilistically. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
4 Example 1: The random graph L = {E}. Build a graph with domain ω, probabilistically. For each pair i j, flip a coin: Heads iej Tails iej Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
5 Example 1: The random graph L = {E}. Build a graph with domain ω, probabilistically. For each pair i j, flip a coin: Heads iej Tails iej Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
6 Example 1: The random graph L = {E}. Build a graph with domain ω, probabilistically. For each pair i j, flip a coin: Heads iej Tails iej Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Independence: If {i 1,..., i n } and {j 1,..., j m } are disjoint, the induced subgraphs on these sets are probabalistically independent. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
7 Example 1: The random graph L = {E}. Build a graph with domain ω, probabilistically. For each pair i j, flip a coin: Heads iej Tails iej Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Independence: If {i 1,..., i n } and {j 1,..., j m } are disjoint, the induced subgraphs on these sets are probabalistically independent. Concentration: The resulting graph is isomorphic to the random graph G R with probability 1. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
8 Example 2: The kaleidoscope random graph L = {E k k ω}. For each pair i j, flip a coin for each E k. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
9 Example 2: The kaleidoscope random graph L = {E k k ω}. For each pair i j, flip a coin for each E k. The result looks like countably many graphs, all stacked on the same domain, or a complete graph with edges labeled by P(ω). Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
10 Example 2: The kaleidoscope random graph L = {E k k ω}. For each pair i j, flip a coin for each E k. The result looks like countably many graphs, all stacked on the same domain, or a complete graph with edges labeled by P(ω). Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
11 Example 2: The kaleidoscope random graph L = {E k k ω}. For each pair i j, flip a coin for each E k. The result looks like countably many graphs, all stacked on the same domain, or a complete graph with edges labeled by P(ω). Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Independence: If {i 1,..., i n } and {j 1,..., j m } are disjoint, the induced subgraphs on these sets are probabalistically independent. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
12 Example 2: The kaleidoscope random graph L = {E k k ω}. For each pair i j, flip a coin for each E k. The result looks like countably many graphs, all stacked on the same domain, or a complete graph with edges labeled by P(ω). Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Independence: If {i 1,..., i n } and {j 1,..., j m } are disjoint, the induced subgraphs on these sets are probabalistically independent. Anti-concentration: Every countable L-structure (indeed, every edge label from P(ω)) occurs with probability 0. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
13 Example 2: The kaleidoscope random graph L = {E k k ω}. For each pair i j, flip a coin for each E k. The result looks like countably many graphs, all stacked on the same domain, or a complete graph with edges labeled by P(ω). Symmetry: The probability of seeing a given induced subgraph on {i 1,..., i n } doesn t depend on the choice of {i 1,..., i n }. Independence: If {i 1,..., i n } and {j 1,..., j m } are disjoint, the induced subgraphs on these sets are probabalistically independent. Anti-concentration: Every countable L-structure (indeed, every edge label from P(ω)) occurs with probability 0. However, there is a reasonable complete first-order theory T such that we get a model of T with probability 1. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
14 The setting The space: Fix a countable relational language L. Str L = the space of L-structures with domain ω = R L 2 (ωar(r) ) Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
15 The setting The space: Fix a countable relational language L. Str L = the space of L-structures with domain ω = R L 2 (ωar(r) ) The logic action: S acts on Str L by permutations of ω. Orb(M) = {N σ S, σ(m) = N} = {N N = M} Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
16 The setting The space: Fix a countable relational language L. Str L = the space of L-structures with domain ω = R L 2 (ωar(r) ) The logic action: S acts on Str L by permutations of ω. Orb(M) = {N σ S, σ(m) = N} = {N N = M} Given a formula of ϕ in L ω1,ω and a tuple n from ω, [ϕ(n)] = {M Str L M = ϕ(n)} is a Borel set. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
17 Random structures Definition A random structure is a Borel probability measure on Str L which is invariant and ergodic for the logic action. Invariant: µ(x) = µ(σ[x]). Ergodic: µ(x σ[x]) = 0 for all σ = µ(x) = 0 or 1. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
18 Random structures Definition A random structure is a Borel probability measure on Str L which is invariant and ergodic for the logic action. Invariant: µ(x) = µ(σ[x]). Ergodic: µ(x σ[x]) = 0 for all σ = µ(x) = 0 or 1. A measure µ on Str L is uniquely determined by its restriction to the clopen sets quantifier-free formulas. Invariance Symmetry: µ([ϕ(n)]) = µ([ϕ(σ(n))]) Ergodicity Independence: µ([ϕ(n) ψ(m)]) = µ([ϕ(n)])µ([ψ(m)]) when n and m are disjoint. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
19 A dichotomy If ϕ is a sentence of L ω1,ω, then [ϕ] is invariant, so µ([ϕ]) = 0 or 1. Write µ = ϕ if µ([ϕ]) = 1, and Th Lω1,ω(µ) = {ϕ L ω1,ω µ = ϕ}. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
20 A dichotomy If ϕ is a sentence of L ω1,ω, then [ϕ] is invariant, so µ([ϕ]) = 0 or 1. Write µ = ϕ if µ([ϕ]) = 1, and Th Lω1,ω(µ) = {ϕ L ω1,ω µ = ϕ}. Theorem (Scott) Let M be a countable L-structure. Then there is a sentence θ M in L ω1,ω, the Scott sentence of M, such that for any countable L-structure N, N = θ M iff N = M, i.e. Orb(M) = [θ M ]. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
21 A dichotomy If ϕ is a sentence of L ω1,ω, then [ϕ] is invariant, so µ([ϕ]) = 0 or 1. Write µ = ϕ if µ([ϕ]) = 1, and Th Lω1,ω(µ) = {ϕ L ω1,ω µ = ϕ}. Theorem (Scott) Let M be a countable L-structure. Then there is a sentence θ M in L ω1,ω, the Scott sentence of M, such that for any countable L-structure N, N = θ M iff N = M, i.e. Orb(M) = [θ M ]. Let µ be a random structure. Either For some countable M, µ = θ M. We say µ concentrates on M. For all countable M, µ = θ M. We say µ is properly ergodic. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
22 Trivial dcl Definition Let M be a countable structure. M has trivial definable closure (dcl) if a M, b M \ a, σ Aut(M/a) such that σ(b) b. Let T be a complete theory in a countable fragment of L ω1,ω. T has trivial dcl if for all ψ it does not contain x! y ( n i=1 y x i ψ(x, y)). Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
23 Trivial dcl Definition Let M be a countable structure. M has trivial definable closure (dcl) if a M, b M \ a, σ Aut(M/a) such that σ(b) b. Let T be a complete theory in a countable fragment of L ω1,ω. T has trivial dcl if for all ψ it does not contain x! y ( n i=1 y x i ψ(x, y)). Trivial dcl is the only restriction imposed by randomness. Theorem (Ackerman-Freer-Patel) Let M be a countable structure. There exists a random structure µ concentrating on M iff M has trivial dcl. Let ϕ be a sentence of L ω1,ω, and let F be the countable fragment generated by ϕ. There exists a random structure µ = ϕ iff there is a complete consistent F -theory T, containing ϕ, with trivial dcl. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
24 Properly ergodic models What about properly ergodic models? In the kaleidoscope random graph, the measure is spread across a perfect tree of quantifier-free types. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
25 Properly ergodic models What about properly ergodic models? In the kaleidoscope random graph, the measure is spread across a perfect tree of quantifier-free types. All instances of proper ergodicity can be explained in this way - but the perfect tree of types may be hiding in a higher fragment of L ω1,ω. Theorem (Ackerman-Freer-K.-Patel) Let ϕ be a sentence of L ω1,ω. The following are equivalent: 1 There exists a properly ergodic random structure µ = ϕ. 2 There is a countable fragment F of L ω1,ω and a complete consistent F -theory T, containing ϕ, with trivial dcl, such that S F (T ) = 2 ℵ 0. S F (T ) = {p(x) p is a complete F -type realized in some model of T } Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
26 The Morley/Scott analysis Idea: Tie the concentration/anti-concentration dichotomy to properties of type spaces, via a Morley/Scott analysis. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
27 The Morley/Scott analysis Idea: Tie the concentration/anti-concentration dichotomy to properties of type spaces, via a Morley/Scott analysis. Given a random structure µ, build a ω 1 -length sequence of fragments. F 0 = first-order F λ = F α, λ a limit α<λ { } F α+1 = F α ϕ p S Fα (µ), ϕ p where S F (µ) = {p(x) p is a complete F -type such that µ(p) > 0}. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
28 The Morley/Scott analysis p S Fα (µ) splits later if there exists β > α such that for all q S Fβ (µ) with q p, µ(q) < µ(p). Proposition For every µ, there exists λ < ω 1 such that no type in S Fλ (µ) splits later. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
29 The Morley/Scott analysis p S Fα (µ) splits later if there exists β > α such that for all q S Fβ (µ) with q p, µ(q) < µ(p). Proposition For every µ, there exists λ < ω 1 such that no type in S Fλ (µ) splits later. n, p SF n (µ) µ(p) = 1 µ concentrates on some countable M. λ (F λ -types determine F λ+1 -types, µ gives measure 1 to a Scott sentence) n, p SF n (µ) µ(p) < 1 µ is properly ergodic. λ (There is a positive measure cloud.) Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
30 The Morley/Scott analysis p S Fα (µ) splits later if there exists β > α such that for all q S Fβ (µ) with q p, µ(q) < µ(p). Proposition For every µ, there exists λ < ω 1 such that no type in S Fλ (µ) splits later. n, p SF n (µ) µ(p) = 1 µ concentrates on some countable M. λ (F λ -types determine F λ+1 -types, µ gives measure 1 to a Scott sentence) n, p SF n (µ) µ(p) < 1 µ is properly ergodic. λ (There is a positive measure cloud.) Theorem (K.) If µ is properly ergodic, then Th Lω1,ω(µ) has no models of any cardinality. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
31 The AFP construction Theorem (Ackerman-Freer-K.-Patel) Let ϕ be a sentence of L ω1,ω. The following are equivalent: 1 There exists a properly ergodic random structure µ = ϕ. 2 There is a countable fragment F of L ω1,ω and a complete consistent F -theory T, containing ϕ, with trivial dcl, such that S F (T ) = 2 ℵ 0. (1) = (2): Clouds must have size 2 ℵ 0. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
32 The AFP construction Theorem (Ackerman-Freer-K.-Patel) Let ϕ be a sentence of L ω1,ω. The following are equivalent: 1 There exists a properly ergodic random structure µ = ϕ. 2 There is a countable fragment F of L ω1,ω and a complete consistent F -theory T, containing ϕ, with trivial dcl, such that S F (T ) = 2 ℵ 0. (1) = (2): Clouds must have size 2 ℵ 0. (2) = (1): A variant of the AFP construction. Build a Borel L-structure M, such that I.I.D. sampling of a countable substructure from M gives a model of T with probability 1. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
33 The AFP construction Theorem (Ackerman-Freer-K.-Patel) Let ϕ be a sentence of L ω1,ω. The following are equivalent: 1 There exists a properly ergodic random structure µ = ϕ. 2 There is a countable fragment F of L ω1,ω and a complete consistent F -theory T, containing ϕ, with trivial dcl, such that S F (T ) = 2 ℵ 0. (1) = (2): Clouds must have size 2 ℵ 0. (2) = (1): A variant of the AFP construction. Build a Borel L-structure M, such that I.I.D. sampling of a countable substructure from M gives a model of T with probability 1. Along the way, carefully split the measure across a perfect tree of n-types to create a cloud, ensuring proper ergodicity. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
34 An analogue of Vaught s conjecture Observation If a sentence ϕ has only countably many countable models {M i } i ω, then it has no properly ergodic model: 1 = µ([ϕ]) = µ( i ω [θ M i ]) = 0. Corollary (K.) If ϕ has a properly ergodic model, then it has 2 ℵ 0 -many countable models. This corollary also has an easy descriptive set theory proof. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
35 An analogue of Vaught s conjecture Observation If a sentence ϕ has only countably many countable models {M i } i ω, then it has no properly ergodic model: 1 = µ([ϕ]) = µ( i ω [θ M i ]) = 0. Corollary (K.) If ϕ has a properly ergodic model, then it has 2 ℵ 0 -many countable models. This corollary also has an easy descriptive set theory proof. Recall: Theorem If µ is properly ergodic, then Th Lω1,ω(µ) has no models of any cardinality. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
36 An analogue of Vaught s conjecture Observation If a sentence ϕ has only countably many countable models {M i } i ω, then it has no properly ergodic model: 1 = µ([ϕ]) = µ( i ω [θ M i ]) = 0. Corollary (K.) If ϕ has a properly ergodic model, then it has 2 ℵ 0 -many countable models. This corollary also has an easy descriptive set theory proof. Theorem (update) If µ is properly ergodic, then Th Lω1,ω(µ) has no models of any cardinality. But if F is a countable fragment, then Th F (µ) = {ϕ F µ = ϕ} has 2 ℵ 0 -many countable models. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
37 Why ergodic measures? Philosophy: An ergodic invariant measure plays the role of a single random structure, as opposed to a weighted average over a class of random structures. Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
38 Why ergodic measures? Philosophy: An ergodic invariant measure plays the role of a single random structure, as opposed to a weighted average over a class of random structures. 1 Logic: Invariant measures do not have a zero-one law for sentences, in general, so no complete theory. 2 Ergodic theory: The ergodic measures are the extreme points in the space of invariant measures. 3 Probability: Ergodic measures arise naturally via I.I.D sampling from probabalistic structures. 4 Combinatorics: An ergodic measure on Str L is one way of representing the limit of a convergent sequence of finite structures. Other equivalent limit objects include graphons (Lovász and Szegedy in the case of graphs), hypergraph limits (Kallenberg, Austin, etc.), and flag algebra homomorphisms (Razborov). Alex Kruckman (UC Berkeley) Properly ergodic random structures June 11, / 14
The 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 informationINVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES NATHANAEL ACKERMAN, CAMERON FREER, AND REHANA PATEL Abstract. Let L be a countable language. We say that a countable infinite L-structure M admits
More informationInfinitary Limits of Finite Structures. Alex Kruckman. A dissertation submitted in partial satisfaction of the. requirements for the degree of
Infinitary Limits of Finite Structures by Alex Kruckman A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division
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 informationTHE ENTROPY FUNCTION OF AN INVARIANT MEASURE
THE ENTROPY FUNCTION OF AN INVARIANT MEASURE NATHANAEL ACKERMAN, CAMERON FREER, AND REHANA PATEL Abstract. Given a countable relational language L, we consider probability measures on the space of L-structures
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 informationA Vaught s conjecture toolbox
Chris Laskowski University of Maryland 2 nd Vaught s conjecture conference UC-Berkeley 1 June, 2015 Everything begins with the work of Robert Vaught. Everything begins with the work of Robert Vaught. Fix
More informationA CLASSIFICATION OF ORBITS ADMITTING A UNIQUE INVARIANT MEASURE
A CLASSIFICATION OF ORBITS ADMITTING A UNIQUE INVARIANT MEASURE NATHANAEL ACKERMAN, CAMERON FREER, ALEKSANDRA KWIATKOWSKA, AND REHANA PATEL Abstract. We consider the space of countable structures with
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 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 informationNON-ISOMORPHISM INVARIANT BOREL QUANTIFIERS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 NON-ISOMORPHISM INVARIANT BOREL QUANTIFIERS FREDRIK ENGSTRÖM AND PHILIPP SCHLICHT Abstract. Every
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 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 September 17, 2014 Abstract
More informationOn 0,1-laws and super-simplicity
On 0,1-laws and super-simplicity Cameron Donnay Hill Abstract In Hill [13], it is shown (as a special case) that for an algebraically trivial Fraïssé class K, if the generic theory T K is an almost-sure
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 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 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 informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
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 informationMath 225A Model Theory. Speirs, Martin
Math 5A Model Theory Speirs, Martin Autumn 013 General Information These notes are based on a course in Metamathematics taught by Professor Thomas Scanlon at UC Berkeley in the Autumn of 013. The course
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 informationComputability of 0-1 Laws
Computability of 0-1 Laws Nate Ackerman University of California, Berkeley Stanford Logic Seminar December 7, 2010 0-1 Law For First Order Logic Lets begin by reviewing what the 0-1 law for first order
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 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 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 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 informationA sufficient condition for super-simplicity of almost-sure theories
A sufficient condition for super-simplicity of almost-sure theories Cameron Donnay Hill May 16, 2017 Abstract In Hill [11], it was shown that an almost-sure theory for a Fraïssé class K relative to an
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 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 informationCayley Graphs of Finitely Generated Groups
Cayley Graphs of Finitely Generated Groups Simon Thomas Rutgers University 13th May 2014 Cayley graphs of finitely generated groups Definition Let G be a f.g. group and let S G { 1 } be a finite generating
More informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
More informationarxiv: v3 [math.pr] 18 Aug 2017
Sparse Exchangeable Graphs and Their Limits via Graphon Processes arxiv:1601.07134v3 [math.pr] 18 Aug 2017 Christian Borgs Microsoft Research One Memorial Drive Cambridge, MA 02142, USA Jennifer T. Chayes
More informationDEFINABLE ENCODINGS IN THE COMPUTABLY ENUMERABLE SETS
DEFINABLE ENCODINGS IN THE COMPUTABLY ENUMERABLE SETS PETER A. CHOLAK AND LEO A. HARRINGTON 1. Introduction The purpose of this communication is to announce some recent results on the computably enumerable
More informationDecidability of integer multiplication and ordinal addition. Two applications of the Feferman-Vaught theory
Decidability of integer multiplication and ordinal addition Two applications of the Feferman-Vaught theory Ting Zhang Stanford University Stanford February 2003 Logic Seminar 1 The motivation There are
More informationUndecidability of Linear Inequalities Between Graph Homomorphism Densities
Undecidability of Linear Inequalities Between Graph Homomorphism Densities Hamed Hatami joint work with Sergey Norin School of Computer Science McGill University December 4, 2013 Hamed Hatami (McGill University)
More informationSzemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)
Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a
More informationΠ 0 1-presentations of algebras
Π 0 1-presentations of algebras Bakhadyr Khoussainov Department of Computer Science, the University of Auckland, New Zealand bmk@cs.auckland.ac.nz Theodore Slaman Department of Mathematics, The University
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 informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
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 informationAn inner model from Ω-logic. Daisuke Ikegami
An inner model from Ω-logic Daisuke Ikegami Kobe University 12. November 2014 Goal & Result Goal Construct a model of set theory which is close to HOD, but easier to analyze. Goal & Result Goal Construct
More informationPseudofinite Model Theory. Anand Pillay, and friends
Pseudofinite Model Theory Anand Pillay, and friends April 13, 2015 These notes are based on a course given by Anand Pillay in the Autumn of 2014 at the University of Notre Dame. They were transcribed from
More informationOuter Model Satisfiability. M.C. (Mack) Stanley San Jose State
Outer Model Satisfiability M.C. (Mack) Stanley San Jose State The Universe of Pure Sets V 0 = V α+1 = P(V α ) = { x : x V α } V λ = V α, λ a limit α
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 informationReasoning with Probabilities. Eric Pacuit Joshua Sack. Outline. Basic probability logic. Probabilistic Epistemic Logic.
Reasoning with July 28, 2009 Plan for the Course Day 1: Introduction and Background Day 2: s Day 3: Dynamic s Day 4: Reasoning with Day 5: Conclusions and General Issues Probability language Let Φ be a
More informationLópez-Escobar s theorem and metric structures
López-Escobar s theorem and metric structures Descriptive set theory and its applications AMS Western section meeting Salt Lake, April 2016 Samuel Coskey Boise State University Presenting joint work with
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 informationERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXXI, 2(2002), pp. 201 210 201 ERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES G. R. GOODSON Abstract. We investigate the question of when an ergodic automorphism
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 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 informationIsomorphisms of Non-Standard Fields and Ash s Conjecture
Isomorphisms of Non-Standard Fields and Ash s onjecture Rumen Dimitrov 1, Valentina Harizanov 2, Russell Miller 3, and K.J. Mourad 4 1 Department of Mathematics, Western Illinois University, Macomb, IL
More informationMain Goals. The Computably Enumerable Sets. The Computably Enumerable Sets, Creative Sets
Main Goals The Computably Enumerable Sets A Tutorial Peter Cholak University of Notre Dame Department of Mathematics Peter.Cholak.1@nd.edu http://www.nd.edu/~cholak/papers/ http://www.nd.edu/~cholak/papers/cholakkobe.pdf
More informationProbability Theory. Probability and Statistics for Data Science CSE594 - Spring 2016
Probability Theory Probability and Statistics for Data Science CSE594 - Spring 2016 What is Probability? 2 What is Probability? Examples outcome of flipping a coin (seminal example) amount of snowfall
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 informationComputability Theoretic Properties of Injection Structures
Computability Theoretic Properties of Injection Structures Douglas Cenzer 1, Valentina Harizanov 2 and Jeffrey B. Remmel 3 Abstract We study computability theoretic properties of computable injection structures
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 informationFields and Galois Theory. Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory.
Fields and Galois Theory Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory. This should be a reasonably logical ordering, so that a result here should
More informationThe Countable Henkin Principle
The Countable Henkin Principle Robert Goldblatt Abstract. This is a revised and extended version of an article which encapsulates a key aspect of the Henkin method in a general result about the existence
More informationJUMPS IN SPEEDS OF HEREDITARY PROPERTIES IN FINITE RELATIONAL LANGUAGES
JUMPS IN SPEEDS OF HEREDITARY PROPERTIES IN FINITE RELATIONAL LANGUAGES MICHAEL C. LASKOWSKI AND CAROLINE A. TERRY Abstract. Given a finite relational language L, a hereditary L-property is a class of
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 informationGENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS
GENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS ANTHONY BONATO, PETER CAMERON, DEJAN DELIĆ, AND STÉPHAN THOMASSÉ ABSTRACT. A relational structure A satisfies the n k property if whenever
More informationPattern Logics and Auxiliary Relations
Pattern Logics and Auxiliary Relations Diego Figueira Leonid Libkin University of Edinburgh Abstract A common theme in the study of logics over finite structures is adding auxiliary predicates to enhance
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 informationON VC-MINIMAL THEORIES AND VARIANTS. 1. Introduction
ON VC-MINIMAL THEORIES AND VARIANTS VINCENT GUINGONA AND MICHAEL C. LASKOWSKI Abstract. In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablity
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationHenkin constructions of models with size continuum
Henkin constructions of models with size continuum John T. Baldwin Department of Mathematics University of Illinois, Chicago Michael C. Laskowski Department of Mathematics University of Maryland September
More informationBorel Complexity and Potential Canonical Scott Sentences
Borel Complexity and Potential Canonical Scott Sentences Douglas Ulrich, Richard Rast, and Michael C. Laskowski Department of Mathematics University of Maryland, College Park arxiv:1510.05679v3 [math.lo]
More informationBuilding Infinite Processes from Finite-Dimensional Distributions
Chapter 2 Building Infinite Processes from Finite-Dimensional Distributions Section 2.1 introduces the finite-dimensional distributions of a stochastic process, and shows how they determine its infinite-dimensional
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 informationThe modal logic of forcing
Joel David Hamkins New York University, Philosophy The City University of New York, Mathematics College of Staten Island of CUNY The CUNY Graduate Center London, August 5 6, 2011 This is joint work with
More informationSEPARABLE MODELS OF RANDOMIZATIONS
SEPARABLE MODELS OF RANDOMIZATIONS URI ANDREWS AND H. JEROME KEISLER Abstract. Every complete first order theory has a corresponding complete theory in continuous logic, called the randomization theory.
More informationThe number of countable models
The number of countable models Enrique Casanovas March 11, 2012 1 Small theories Definition 1.1 T is small if for all n < ω, S n ( ) ω. Remark 1.2 If T is small, then there is a countable L 0 L such that
More informationarxiv: v2 [math.lo] 16 Oct 2015
CATEGORICITY AND INFINITARY LOGICS arxiv:1508.03316v2 [math.lo] 16 Oct 2015 WILL BONEY AND SEBASTIEN VASEY Abstract. We point out a gap in Shelah s proof of the following result: Claim 0.1. Let K be an
More informationPRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY
Iranian Journal of Fuzzy Systems Vol. 10, No. 3, (2013) pp. 103-113 103 PRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY S. M. BAGHERI AND M. MONIRI Abstract. We present some model theoretic results for
More informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 2011 Dr. Dave Parker Department of Computer Science University of Oxford Overview Temporal logic Non-probabilistic temporal logic CTL Probabilistic temporal
More informationThe nite submodel property and ω-categorical expansions of pregeometries
The nite submodel property and ω-categorical expansions of pregeometries Marko Djordjevi bstract We prove, by a probabilistic argument, that a class of ω-categorical structures, on which algebraic closure
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 February 8, 2006 Abstract We give a model
More informationFROM COHERENT TO FINITENESS SPACES
FROM COHERENT TO FINITENESS SPACES PIERRE HYVERNAT Laboratoire de Mathématiques, Université de Savoie, 73376 Le Bourget-du-Lac Cedex, France. e-mail address: Pierre.Hyvernat@univ-savoie.fr Abstract. This
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 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 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 informationFirst-order limits, an analytical perspective
First-order limits, an analytical perspective Jaroslav Nesetril, Patrice Ossona de Mendez To cite this version: Jaroslav Nesetril, Patrice Ossona de Mendez. First-order limits, an analytical perspective.
More informationProjective well-orderings of the reals and forcing axioms
Projective well-orderings of the reals and forcing axioms Andrés Eduardo Department of Mathematics Boise State University 2011 North American Annual Meeting UC Berkeley, March 24 27, 2011 This is joint
More informationINTERPRETING HASSON S EXAMPLE
INTERPRETING HASSON S EXAMPLE CHARLES K. SMART Abstract. We generalize Ziegler s fusion result [8] by relaxing the definability of degree requirement. As an application, we show that an example proposed
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 informationMeasurability Problems for Boolean Algebras
Measurability Problems for Boolean Algebras Stevo Todorcevic Berkeley, March 31, 2014 Outline 1. Problems about the existence of measure 2. Quests for algebraic characterizations 3. The weak law of distributivity
More informationA New Notion of Cardinality for Countable First Order Theories
A New Notion of Cardinality for Countable First Order Theories Douglas Ulrich, Richard Rast, and Michael C. Laskowski Department of Mathematics University of Maryland, College Park October 19, 2015 Abstract
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 informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
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 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 informationRandom Graphs. and. The Parity Quantifier
Random Graphs and The Parity Quantifier Phokion G. Kolaitis Swastik Kopparty UC Santa Cruz MIT & & IBM Research-Almaden Institute for Advanced Study What is finite model theory? It is the study of logics
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 July 12, 2006 Abstract We give a model theoretic
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 informationGEOMETRIC STRUCTURES WITH A DENSE INDEPENDENT SUBSET
GEOMETRIC STRUCTURES WITH A DENSE INDEPENDENT SUBSET ALEXANDER BERENSTEIN AND EVGUENI VASSILIEV Abstract. We generalize the work of [13] on expansions of o-minimal structures with dense independent subsets,
More informationStatistical Inference
Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory
More informationComputability in the class of Real Closed Fields
Computability in the class of Real Closed Fields Víctor A. Ocasio-González Department of Mathematics University of Notre Dame MCS @ UChicago Oct. 1, 2013 Outline 1 Turing computable embeddings 2 Categoricity
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 information