VC-DENSITY FOR TREES
|
|
- Bernard Little
- 5 years ago
- Views:
Transcription
1 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 Starchenko as a natural notion of dimension for NIP theories. In a NIP theory we can define a VC function vc : N N Where vc(n) measures complexity of definable sets in an n-dimensional space. Simplest possible behavior is vc(n) = n for all n. Theories with that property are known to be dp-minimal, i.e. having the smallest possible dp-rank. In general, it is not known whether there can be a dp-minimal theory which doesn t satisfy vc(n) = n. In this paper we work with trees viewed as posets. Parigot in [3] showed that such models have NIP. This result was strengthened by Simon in [2] showing that trees are dp-minimal. [1] has the following problem Problem 0.1. ([1] p. 47) Determine the VC density function of each (infinite) tree. Here we settle this question by showing that theory of trees has vc(n) = n. 1. Preliminaries We use notation a T n for tuples of size n. For variable x or tuple a we denote their arity by x and a respectively. We work with finite relational languages. Given a formula we can define its complexity n as the depth of quantifiers used to build up the formula. More precisely Definition 1.1. Define complexity of a formula by induction: Complexity(q.f. formula) = 0 Complexity( xφ(x)) = Complexity(φ(x)) + 1 Complexity(φ ψ) = max(complexity(φ), Complexity(ψ)) Complexity( φ) = Complexity(φ) A simple inductive argument verifies that there are (up to equivalence) only finitely many formulas with fixed complexity and the number of free variables. We will use the following notation for types: Definition 1.2. Let n, m be naturals, B a structure, A a parameter set and a, b tuples in B. 1
2 2 ANTON BOBKOV tp n B (a/a) will stand for all the A-formulas of complexity n that are true of a in B. If A = we may write tp n B (a). B will be omitted as well if it is clear from context. Note that if A is finite there are finitely many of such formulas (up to an equivalence). Conjunction of those formulas would still have complexity n so we can just associate a single formula describing such a type. B = a n A b means that a, b have the same type of complexity n over A in B, i.e. tp n B (a/a) = tpn B (b/a) SB,m n (A) will stand for all m-types of complexity n over A, for example tp n B (a/a) Sn B,m (A) assuming a = m. Language for the trees consists of a single binary predicate { }. Theory of trees states that defines a partial order and for every element a we have {x x < a} a linear order. For visualization purposes we assume trees grow upwards, with smaller elements on the bottom and larger elements on the top. If a b we will say that a is below b and b is above a. Definition 1.3. Work in a tree T. For x T let I(x) = {t T t x} denote all the elements below x. Meet of two tree elements a, b is the greatest element of I(a) I(b) (if one exists) and is denoted by a b. Theory of meet trees requires that any two elements in the same connected component have a meet. Colored trees are trees with a finite number of colors added via unary predicates. From now on assume that all trees are colored. We allow our trees to be disconnected or finite unless otherwise stated. For completeness we also present definition of VC function. One should refer to [1] for more details. Suppose we have a collection S of subsets of X. We define a shatter function π S (n) π S (n) = max{ A S : A X and A = n} Sauer s Lemma asserts that asymptotically π S is either 2 n or polynomial. In the polynomial case we define VC density of S to be power of polynomial that bounds π S. More formally vc(s) = lim sup n log π S log n Given a model M = T and a formula φ(x, y) we define S φ = {φ(m n, b) : b M y } vc(φ) = vc(s φ ) One has to check that this definition is independent of realization of T, see [1], Lemma 3.2. For a theory T we define the VC function Also, [1], 3.2 tells us that vc(m) m. vc(n) = sup{vc(φ(x, y)) : x = n}
3 VC-DENSITY FOR TREES 3 2. Proper Subdivisions: Definition and Properties Definition 2.1. Let A, B, T be models in some (possibly different) finite relational languages. If A, B partition T (i.e. T = A B) we say that (A, B) is a subdivision of T. Definition 2.2. (A, B) subdivision of T is called n-proper if for all p, q N, for all a 1, a 2 A p and b 1, b 2 B q we have then A = a 1 n a 2 B = b 1 n b 2 T = a 1 b 1 n a 2 b 2 Definition 2.3. (A, B) subdivision of T is called proper if it is n-proper for all n N. Lemma 2.4. Consider a subdivision (A, B) of T. If it is 0-proper then it is proper. Proof. Prove the subdivision is n-proper for all n by induction. Case n = 0 is given by the assumption. Suppose n = k + 1 and we have T = x φ k (x, a 1, b 1 ) where φ k is some formula of complexity k. Let a T witness the existential claim i.e. T = φ k (a, a 1, b 1 ). We can have a A or a B. Without loss of generality assume a A. Let p = tp k A (a, a 1). Then we have A = x tp k A(x, a 1 ) = p Formula tp k A (x, a 1) = p is of complexity k so x tp k A (x, a 1) = p is of complexity k + 1. By inductive hypothesis we have A = x tp k A(x, a 2 ) = p Let a witness this existential claim so that by inductive hypothesis we have T = aa 1 b 1 k a a 2 b 2 tp k A(a, a 2 ) = p tp k A(a, a 2 ) = tp k A(a, a 1 ) A = a a 2 k aa 1 T = φ k (a, a 2, b 2 ) as T = φ k (a, a 1, b 1 ) T = xφ k (x, a 2, b 2 ) We use this lemma for (colored) trees. Suppose we have T to be a model of a (colored) tree in some language L = {,...} and A, B be in some languages L A, L B which will be expands of L, with A, B substructures of T as reducts to L. In this case we ll refer to (A, B) as a proper subdivision (of T ). Example 2.5. Suppose a tree consists of two connected components C 1, C 2. Then those components (C 1,,...), (C 2,,...) interpreted as substructures form a proper subdivision.
4 4 ANTON BOBKOV Example 2.6. Fix a tree T in the language { } and a T. Let B = {t T a < t}, S = {t T t a}, A = T B. Then (A,, S) and (B, ) form a proper subdivision, where L A has a unary predicate interpreted by S. Definition 2.7. For φ(x, y), A T x and B T y Let φ(a, b) = {a A φ(a, b)} A Let φ(a, B) = {φ(a, b) b B} P(A) φ(a, B) is a collection of subsets of A definable by φ with parameters from B. We notice the following bound when A, B are parts of a proper subdivision. Corollary 2.8. Let A, B be a proper subdivision of T and φ(x, y) is a formula of complexity n. Then φ(a x, B y ) is bounded by S n B, y. Proof. Take some a A x and b 1, b 2 B y with tp n B (b 1) = tp n B (b 2). We have B = b 1 n b 2 and (trivially) A = a n a. Thus by the Lemma 2.4 we have T = ab 1 n ab 2 so φ(a, b 1 ) φ(a, b 2 ). Since a was arbitrary we have φ(a x, b 1 ) = φ(a x, b 2 ). That is different traces can only come from parameters of different types. Thus φ(a x, B y ) SB, y n. We note that the size of that type space can be bounded uniformly. Definition 2.9. Fix a (finite relational) language L B, and n, y. Let N = N(n, y, L B ) be smallest number such that for any structure B in L B we have SB, y n N. This number is well-defined as there are a finite number (up to equivalence) of possible formulas of complexity n with y free variables. Note the following easy inequalities n m N(n, y, L B ) N(m, y, L B ) y z N(n, y, L B ) N(n, z, L B ) L A L B N(n, y, L A ) N(n, y, L B ) 3. Proper Subdivisions: Constructions From now on work in meet trees unless mentioned otherwise. First, we describe several constructions of proper subdivisions that are needed for the proof. Definition 3.1. We say that E(b, c) if b and c are in the same connected component E(b, c) x (b x) (c x) Definition 3.2. Given a tree element a we can look at all elements above a, i.e. {x x a}. We can think about it as a closed cone above a. Connected components of that cone can be thought of an open cones over a. With that interpretation in mind, notation E a (b, c) means that b and c are in the same open cone over a. A more compact way to write it down is through meets: E a (b, c) E(b, c) and (b c) > a Fix a language for colored trees L = {, C 1,... C n } = {, C}. In the following four definitions B-structures are going to be in the same language L B = L {U} with U a unary predicate. It is not always necessary to have this predicate but for the sake of uniformity we keep it. A-structures will have different L A languages (those are not as important in later applications). All the colors C are interpreted by colors in T by restriction.
5 VC-DENSITY FOR TREES 5 c 1 A B Figure 1. Proper subdivision for (A, B) = (A c1, B c1 ) c 1 A B Figure 2. Proper subdivision for (A, B) = (A c1, B c1 )
6 6 ANTON BOBKOV c 1 A Figure 3. Proper subdivision for (A, B) = (A c1 G, Bc1 G ) for G = {} B c 1 A Figure 4. Proper subdivision for (A, B) = (A G, B G ) for G = {c 1, } B
7 VC-DENSITY FOR TREES 7 Definition 3.3. Fix c 1 < in T. Let B = {b T E c1 (, b) (b )} A = T B S 1 = {t T t < c 1 } S 2 = {t T t < } S B = S 2 S 1 T A = {t T t} Define structures A c1 = (A,, C, S 1, T A ) and B c1 = (B,, C, S B ) where L A is expansion of L by two unary predicates (and L B as defined above). Note that c 1, / B. Definition 3.4. Fix c in T. Let B = {b T (b c) E(b, c)} A = T B S 1 = {t T t < c} Define structures A c = (A,, C) and B c = (B,, C, S 1 ) where L A = L (and L B as defined above). Note that c / B. (cf example 2.6). Definition 3.5. Fix c in T and S T a finite subset. Let B = {b T (b > c) and for all s S we have E c (s, b)} A = T B S 1 = {t T t c} Define structures A c S = (A,, C, S 1 ) and B c S = (B,, C, B) where L A is expansion of L by a single unary predicate (and U L B vacuously interpreted by B). Note that c / B and S B =. Definition 3.6. Fix S T a finite subset. Let B = {b T for all s S we have E(s, b)} A = T B Define structures A S = (A, ) and B S = (B,, C, B) where L A = L (and U L B vacuously interpreted by B). Note that S B =. (cf example 2.5) Lemma 3.7. Pairs of structures defined above are all proper subdivisions. Proof. We only show this holds for the first definition A = A c1 and B = B c1. Other cases follow by a similar argument. A, B partition T by definition, so it is a subdivision. To show that it is proper by Lemma 2.4 we only need to check that it is 0-proper. Suppose we have a = (a 1, a 2,..., a p ) A p a = (a 1, a 2,..., a p) A p b = (b 1, b 2,..., b q ) B q b = (b 1, b 2,..., b q) B q
8 8 ANTON BOBKOV with (A, a) 0 (A, a ) and (B, b) 0 (B, b ). We need to make sure that ab has the same quantifier free type as a b. Any two elements in T can be related in the four following ways x = y x < y x > y x, y are incomparable We need to check that the same relations hold for pairs of (a i, b j ), (a i, b j ) for all i, j. It is impossible that a i = b j as they come from disjoint sets. Suppose a i < b j. This forces a i S 1 thus a i S 1 and a i < b j Suppose a i > b j This forces b j S B and a T A, thus b j S B and a i T A so a i > b j Suppose a i and b j are incomparable. Two cases are possible: b j / S B and a i T A. Then b j / S B and a i T A making a i, b j incomparable b j S B, a i / T A, a i / S 1. Similarly this forces a i, b j incomparable Also we need to check that ab has the same colors as a b. But that is immediate as having the same color in the substructure means having the same color in the whole tree. 4. Main proof Basic idea for the proof is as follows. Suppose we have a formula with q parameters. We are able to split our parameter space into O(n) many partitions. Each of q parameters can come from any of those O(n) partitions giving us O(n) q many choices for parameter configuration. When every parameter is coming from a fixed partition the number of definable sets is constant and in fact is uniformly bounded above by some N. This gives us at most N O(n) q possibilities for different definable sets. First, we generalize Corollary 2.8. (This is required for computing vc-density for formulas φ(x, y) with y > 1). Lemma 4.1. Consider a finite collection (A i, B i ) i n where each (A i, B i ) is either a proper subdivision or a singleton: B i = {b i } with A i = T. Also assume that all B i have the same language L B. Let A = i I A i. Fix a formula φ(x, y) of complexity m. Let N = N(m, y, L B ) as in Definition 2.9. Consider any B T y of the form B = B i1 1 Bi Bin n with i 1 + i i n = y (some of the indexes can be zero). Then we have the following bound φ(a x, B) N y
9 VC-DENSITY FOR TREES 9 Proof. We show this result by counting types. Suppose we have Then we have b 1, b 1 B i1 1 with b 1 m b 1 in B 1 b 2, b 2 B i2 2 with b 2 m b 2 in B 2 b n, b n B in n with b n m b n in B n φ(a x, b 1, b 2,... b n ) φ(a x, b 1, b 2,... b n) This is easy to see by applying Corollary 2.8 one by one for each tuple. This works if B i is part of a proper subdivision; if it is a singleton then the implication is trivial as b i = b i. This shows that φ(a x, B) only depends on the choice of types for the tuples φ(a x, B) S m B 1,i 1 S m B 2,i 2... S m B n,i n Now for each type space we have inequality S m B j,i j N(m, i j, L B ) N(m, y, L B ) N (For singletons S m B j,i j = 1 N). Only non-zero indexes contribute to the product and there are at most y of those (by equality i 1 + i i n = y ). Thus we have as needed. φ(a x, B) N y For subdivisions to work out properly we will need to work with subsets closed under meets. We observe that closure under meets doesn t add too many new elements. Lemma 4.2. Suppose S T is a finite subset of size n in a meet tree and S its closure under meets. Then S 2n. Proof. We can partition S into connected components and prove the result separately for each component. Thus we may assume elements of S lie in the same connected component. We prove the claim by induction on n. Base case n = 1 is clear. Suppose we have S of size k with closure of size at most 2k 1. Take a new point s, and look at its meets with all the elements of S. Pick the smallest one, s. Then S {s, s } is closed under meets. Putting all of those results together we are able to compute vc-density of formulas in meet trees. Theorem 4.3. Let T be an infinite (colored) meet tree and φ(x, y) a formula with x = p and y = q. Then vc(φ) q. Proof. Pick a finite subset of S 0 T p of size n. Let S 1 T consist of coordinates of S 0. Let S T be a closure of S 1 under meets. Using Lemma 4.2 we have S 2 S 1 2p S 0 = 2pn = O(n). We have S 0 S p, so φ(s 0, T q ) φ(s p, T q ). Thus it is enough to show φ(s p, T q ) = O(n q ). Label S = {c i } i I with I 2pn. For every c i we construct two partitions in the following way. We have c i is either minimal in S or it has a predecessor in S (greatest element less than c). If it is minimal construct (A ci, B ci ). If there
10 10 ANTON BOBKOV is a predecessor p construct (A p c i, B p c i ). For the second subdivision let G be all elements in S greater than c i and construct (A c G, B c G). So far we have constructed two subdivisions for every i I. Additionally construct (A S, B S ). We end up with a finite collection of proper subdivisons (A j, B j ) j J with J = 2 I + 1. Before we proceed we note the following two lemmas describing our partitions. Lemma 4.4. For all j J we have S A j. Thus S j J A j and S p j J (A j) p Proof. Check this for each possible choices of partition. Cases for partitions of the type A S, A c G, A c are easy. Suppose we have partition (A, B) = (A c1, B c1 ). We need to show that B S =. By construction we have c 1, / B. Suppose we have some other c S with c B. We have E c1 (, c) i.e. there is some b such that (b > c 1 ), (b ) and (b c). Consider the meet (c ). We have (c ) b > c 1. Also as (c ) we have (c ) <. To summarize > (c ) > c 1. But this contradicts our construction as S is closed under meets, so (c ) S and c 1 is supposed to be a predecessor of in S. Lemma 4.5. {B j } j J partition T S i.e. T = j J B j S Proof. This more or less follows from the choice of partitions. Pick any b S T. Take all elements in S greater than b and take the minimal one a. Take all elements in S less than b and take the maximal one c (possible as S is closed under meets). Also take all elements in S incomparable to b and denote them G. If both a and c exist we have b B a c. If only upper bound exists we have b B a G. If only lower bound exists we have b B c. If neither exists we have b B G. Note 4.6. Those two lemmas imply S = j J A j Note 4.7. For one-dimensional case q = 1 we don t need to do any more work. We have partitioned parameter space into J = O(n) many pieces and over each piece the number of definable sets is uniformly bounded. By Corollary 2.8 we have that φ((a j ) p, B j ) N for any j J (letting N = N(n φ, q, L {S}) where n φ is complexity of φ and S is a unary predicate). Compute φ(s p, T ) = φ(s p, B j ) φ(s p, S) j J j J j J φ(s p, B j ) + φ(s p, S) φ((a j ) p, B j ) + S j J N + I (4pn + 1)N + 2pn = (4pN + 2p)n + N = O(n) Basic idea for the general case q 1 is that we have q parameters and J = O(n) partitions to pick each parameter from giving us J q = O(n q ) choices for parameter configuration, each giving uniformly constant number of definable subsets of S. (If every parameter is picked from a fixed partition, Lemma 4.1 provides a uniform
11 VC-DENSITY FOR TREES 11 bound). This yields vc(φ) q as needed. The rest of the proof is stating this idea formally. First, we extend our collection of subdivisions (A j, B j ) j J by the following singleton sets. For each c i S let B i = {c i } and A i = T and add (A i, B i ) to our collection with L B the language of B i interpreted arbitrarily. We end up with a new collection (A k, B k ) k K indexed by some K with K = J + I (we added S new pairs). Now we have that B k partition T, so T = k K B k and S = j J A j = k K A k. For (k 1, k 2,... k q ) = k K q denote Then we have the following identity T q = ( B k = B k1 B k2... B kq k K B k ) q = k K q Thus we have that {B k } k K q partition T q. Compute φ(s p, T q ) = φ(s p, B k ) k K q φ(s p, B k ) k K q We can bound φ(s p, B k ) uniformly using Lemma 4.1. (A k, B k ) k K satisfies the requirements of the lemma and B k looks like B in the lemma after possibly permuting some variables in φ. Applying the lemma we get φ(s p, B k ) N q with N only depending on q and complexity of φ. We complete our computation φ(s p, T q ) φ(s p, B k ) k K q k K q N q K q N q ( J + I ) q N q B k (4pn pn) q N q = N q (6p + 1/n) q n q = O(n q ) Corollary 4.8. In the theory of infinite (colored) meet trees we have vc(n) = n for all n. We get the general result for trees that aren t necessarily meet trees via an easy application of interpretability. Corollary 4.9. In the theory of infinite (colored) trees we have vc(n) = n for all n. Proof. Let T be a tree. We can embed it in a larger tree that is closed under meets T T. Expand T by an extra color and interpret it by coloring the subset T. Thus we can interpret T in T 1. By Corollary 3.17 in [1] we get that vc T (n) vc T (1 n) = n thus vc T (n) = n as well.
12 12 ANTON BOBKOV References [1] M. Aschenbrenner, A. Dolich, D. Haskell, D. Macpherson, S. Starchenko, Vapnik-Chervonenkis density in some theories without the independence property, I, preprint (2011) [2] P. Simon, On dp-minimal ordered structures, J. Symbolic Logic 76 (2011), no. 2, [3] Michel Parigot. Théories d arbres. Journal of Symbolic Logic, 47, address: bobkov@math.ucla.edu
UCLA UCLA Electronic Theses and Dissertations
UCLA UCLA Electronic Theses and Dissertations Title Computations of Vapnik-Chervonenkis Density in Various Model-Theoretic Structures Permalink https://escholarship.org/uc/item/5xg6m05f Author Bobkov,
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 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 informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
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 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 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 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 informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationMathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy
Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No
More informationCompleteness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:
Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC
More informationCHAPTER 2. FIRST ORDER LOGIC
CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us
More informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
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 informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationHandout: Proof of the completeness theorem
MATH 457 Introduction to Mathematical Logic Spring 2016 Dr. Jason Rute Handout: Proof of the completeness theorem Gödel s Compactness Theorem 1930. For a set Γ of wffs and a wff ϕ, we have the following.
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 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 informationMACHINE LEARNING - CS671 - Part 2a The Vapnik-Chervonenkis Dimension
MACHINE LEARNING - CS671 - Part 2a The Vapnik-Chervonenkis Dimension Prof. Dan A. Simovici UMB Prof. Dan A. Simovici (UMB) MACHINE LEARNING - CS671 - Part 2a The Vapnik-Chervonenkis Dimension 1 / 30 The
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 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 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 informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
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 informationThe Vapnik-Chervonenkis Dimension
The Vapnik-Chervonenkis Dimension Prof. Dan A. Simovici UMB 1 / 91 Outline 1 Growth Functions 2 Basic Definitions for Vapnik-Chervonenkis Dimension 3 The Sauer-Shelah Theorem 4 The Link between VCD and
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 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 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 informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationDefinable henselian valuation rings
Definable henselian valuation rings Alexander Prestel Abstract We give model theoretic criteria for the existence of and - formulas in the ring language to define uniformly the valuation rings O of models
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 informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationFusing o-minimal structures
Fusing o-minimal structures A.J. Wilkie Mathematical Institute University of Oxford 24-29 St Giles Oxford OX1 3LB UK May 3, 2004 Abstract In this note I construct a proper o-minimal expansion of the ordered
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
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 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 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 informationOn the strong cell decomposition property for weakly o-minimal structures
On the strong cell decomposition property for weakly o-minimal structures Roman Wencel 1 Instytut Matematyczny Uniwersytetu Wroc lawskiego ABSTRACT We consider a class of weakly o-minimal structures admitting
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 information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
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 informationCommutative Banach algebras 79
8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationOn VC-Minimality in Algebraic Structures
On VC-Minimality in Algebraic Structures Vincent Guingona University of Notre Dame 3 April 2012 For the 2012 ASL Annual North American Meeting, Madison, Wisconsin Outline 1 VC-Minimality Convex Orderability
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 informationA SIMPLE PROOF OF THE MARKER-STEINHORN THEOREM FOR EXPANSIONS OF ORDERED ABELIAN GROUPS
A SIMPLE PROOF OF THE MARKER-STEINHORN THEOREM FOR EXPANSIONS OF ORDERED ABELIAN GROUPS ERIK WALSBERG Abstract. We give a short and self-contained proof of the Marker- Steinhorn Theorem for o-minimal expansions
More informationMathematical Foundations of Logic and Functional Programming
Mathematical Foundations of Logic and Functional Programming lecture notes The aim of the course is to grasp the mathematical definition of the meaning (or, as we say, the semantics) of programs in two
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationThere are infinitely many set variables, X 0, X 1,..., each of which is
4. Second Order Arithmetic and Reverse Mathematics 4.1. The Language of Second Order Arithmetic. We ve mentioned that Peano arithmetic is sufficient to carry out large portions of ordinary mathematics,
More informationCONVEXLY ORDERABLE GROUPS AND VALUED FIELDS
CONVEXLY ORDERABLE GROUPS AND VALUED FIELDS JOSEPH FLENNER AND VINCENT GUINGONA Abstract. We consider the model theoretic notion of convex orderability, which fits strictly between the notions of VC-minimality
More informationHOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS
HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS DIEGO ANDRES BEJARANO RAYO Abstract. We expand on and further explain the work by Malliaris and Shelah on the cofinality spectrum by doing
More informationLecture 6 : Induction DRAFT
CS/Math 40: Introduction to Discrete Mathematics /8/011 Lecture 6 : Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we began discussing proofs. We mentioned some proof
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 informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationModel Theory of Real Closed Fields
Model Theory of Real Closed Fields Victoria L. Noquez Carnegie Mellon University Logic and Computation Senior Thesis Advisor: Dr. James Cummings May 2008 Abstract An important fact in the application of
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 informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
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 informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationLINDSTRÖM S THEOREM SALMAN SIDDIQI
LINDSTRÖM S THEOREM SALMAN SIDDIQI Abstract. This paper attempts to serve as an introduction to abstract model theory. We introduce the notion of abstract logics, explore first-order logic as an instance
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationMetainduction in Operational Set Theory
Metainduction in Operational Set Theory Luis E. Sanchis Department of Electrical Engineering and Computer Science Syracuse University Syracuse, NY 13244-4100 Sanchis@top.cis.syr.edu http://www.cis.syr.edu/
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 informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationFaithful embedding on finite orders classes
Faithful embedding on finite orders classes Alain Guillet Jimmy Leblet Jean-Xavier Rampon Abstract We investigate, in the particular case of finite orders classes, the notion of faithful embedding among
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationON VC-MINIMAL FIELDS AND DP-SMALLNESS
ON VC-MINIMAL FIELDS AND DP-SMALLNESS VINCENT GUINGONA Abstract. In this paper, we show that VC-minimal ordered fields are real closed. We introduce a notion, strictly between convexly orderable and dp-minimal,
More informationCone Avoidance of Some Turing Degrees
Journal of Mathematics Research; Vol. 9, No. 4; August 2017 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Cone Avoidance of Some Turing Degrees Patrizio Cintioli
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationAn Application of First-Order Logic to a Problem in Combinatorics 1
An Application of First-Order Logic to a Problem in Combinatorics 1 I. The Combinatorial Background. A. Families of objects. In combinatorics, one frequently encounters a set of objects in which a), each
More informationCOMP 409: Logic Homework 5
COMP 409: Logic Homework 5 Note: The pages below refer to the text from the book by Enderton. 1. Exercises 1-6 on p. 78. 1. Translate into this language the English sentences listed below. If the English
More informationCS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016
CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in
More informationSolutions to Unique Readability Homework Set 30 August 2011
s to Unique Readability Homework Set 30 August 2011 In the problems below L is a signature and X is a set of variables. Problem 0. Define a function λ from the set of finite nonempty sequences of elements
More informationCHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS
CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationSTABILITY AND POSETS
STABILITY AND POSETS CARL G. JOCKUSCH, JR., BART KASTERMANS, STEFFEN LEMPP, MANUEL LERMAN, AND REED SOLOMON Abstract. Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We
More informationDIVIDING AND WEAK QUASI-DIMENSIONS IN ARBITRARY THEORIES
DIVIDING AND WEAK QUASI-DIMENSIONS IN ARBITRARY THEORIES ISAAC GODBRING AND HENRY TOWSNER Abstract. We show that any countable model of a model complete theory has an elementary extension with a pseudofinite-like
More informationON VC-DENSITY IN VC-MINIMAL THEORIES
ON VC-DENSITY IN VC-MINIMAL THEORIES VINCENT GUINGONA Abstract. We show that any formula with two free variables in a VC-minimal theory has VC-codensity at most two. Modifying the argument slightly, we
More informationA Local Normal Form Theorem for Infinitary Logic with Unary Quantifiers
mlq header will be provided by the publisher Local Normal Form Theorem for Infinitary Logic with Unary Quantifiers H. Jerome Keisler 1 and Wafik Boulos Lotfallah 2 1 Department of Mathematics University
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 informationA LOCAL CHARACTERIZATION OF VC-MINIMALITY
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A LOCAL CHARACTERIZATION OF VC-MINIMALITY URI ANDREWS AND VINCENT GUINGONA Abstract. We show VC-minimality
More informationProof Theory and Subsystems of Second-Order Arithmetic
Proof Theory and Subsystems of Second-Order Arithmetic 1. Background and Motivation Why use proof theory to study theories of arithmetic? 2. Conservation Results Showing that if a theory T 1 proves ϕ,
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
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 informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationPropositional and Predicate Logic - IV
Propositional and Predicate Logic - IV Petr Gregor KTIML MFF UK ZS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - IV ZS 2015/2016 1 / 19 Tableau method (from the previous lecture)
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationFunctional Analysis HW #3
Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationIntroduction to Metalogic 1
Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More information