Omitting types in the logic of metric structures (Joint work with I. Farah)

Speaker: 

Menachem Magidor

Institution: 

Einstein Institute of Mathematics

Time: 

Monday, February 4, 2019 - 4:00pm to 5:00pm

Location: 

440R RH

The logic of metric structures was introduced by Ben Yaacov, Berenstein , Henson and Usvyatsov. It is a version of continuous logic which allows fruitful model theory for  many kinds of metric structures .There are many aspects of   this logic which make it similar to  first order logic, like compactness, a complete proof system, an omitting types theorem for complete  types  etc. But when one tries to generalize the omitting type criteria to general (non-complete) types the problem turns out to be essentially more difficult than the first order situation.For instance one can have two types (in a complete theory) that each one can be omitted , but they can not be omitted simultaneously.

Strongly minimal sets in continuous logic

Speaker: 

James Hanson

Institution: 

University of Wisconsin

Time: 

Monday, April 8, 2019 - 4:00pm to 5:00pm

Location: 

RH 440R

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.

Model Theory for Real-valued Structures

Speaker: 

H. Jerome Keisler

Institution: 

University of Wisconsin

Time: 

Monday, January 28, 2019 - 4:00pm

Location: 

RH 440R

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.

 Is $\aleph_1$-categoricity absolute for atomic models?

Speaker: 

Chris Laskowski

Institution: 

University of Maryland

Time: 

Monday, February 4, 2019 - 2:00pm

Location: 

340N RH

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.

Pages

Subscribe to RSS - Logic Set Theory