The precise structural understanding of uncountably categorical theories given by the Baldwin-Lachlan theorem is known to fail in continuous logic in the context of inseparably categorical theories. The primary obstacle is the absence of strongly minimal sets in some inseparably categorical theories. We will develop the concept of strongly minimal sets in continuous logic and discuss some common conditions under which they are present in an ω-stable metric theory. Finally we will examine the extent to which we recover the Baldwin-Lachlan theorem in the presence of strongly minimal sets.
This is the eigth in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We will continue discussing the Borel hierarchy.
Metric structures are like first-order structures except that the formulas take truth values in the unit interval, and instead of equality there is a distance predicate with respect to which every function and predicate is uniformly continuous. Pre-metric structures are similar the distance predicate is only a pseudo-metric. In recent years the model theory of metric and pre-metric structures has been successfully developed in a way that is closely parallel to first order model theory, with many applications to analysis.
We consider general structures, where formulas still have truth values in the unit interval, but the predicates and functions need not be continuous with respect to a distance predicate. It is shown that every general structure can be expanded to a pre-metric structure by adding a distance predicate that is a uniform limit of formulas. Moreover, any two such expansions have the same notion of uniform convergence. This can be used to extend almost all of the model theory of metric structures to general structures in a precise way. For instance, the notion of a stable theory extends in a natural way to general structures, and the main results carry over.
This is the seventh in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We will continue discussing the Borel hierarchy.
This is the sixth in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We will begin discussing the Borel hierarchy.
In first order logic, the Baldwin-Lachlan characterization of $\aleph_1$-categorical
theories implies that the notion is absolute between transitive models of set theory.
Here, we seek a similar characterization for having a unique atomic model of size $\aleph_1$.
At present, we have several conditions that imply many non-isomorphic atomic models of size $\aleph_1$.
Curiously, even though the results are in ZFC, their proofs rely on forcing.
This is joint work with John Baldwin and Saharon Shelah.
This is the fifth in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We continue the discussion of universality properties of Polish spaces and subspaces of Polish spaces.
This is the fourth in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We continue the discussion of universality properties of Polish spaces and subspaces of Polish spaces.
This is the third in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. We continue the discussion of universality properties of Polish spaces and subspaces of Polish spaces.
Recently, nonstandard and ultrafilter methods have been used to obtain a number of significant results in Combinatorial Number Theory. In this talk I will provide a brief overview of some recent work in this area, focusing on the use of nonstandard methods in problems involving the existence of various types of structured sets contained in subsets of the natural numbers that satisfy various density conditions.