Organizers: Nate Ackerman, Rachel Epstein, Cameron Freer, and Rehana Patel.
To be added to the mailing list, please contact .
Recent work of Malliaris and Shelah on modeltheoretic questions around saturation of regular ultrapowers has led also to theorems in set theory and general topology, notably the solution of the oldest problem on cardinal invariants of the continuum. The talk will outline the general program and some features of this recent proof.
We extend these investigations by giving new (shorter) proofs of some of Dzharfarov and Mummert's work, and also showing that all 1generics are FIP, and showing that, for the $\Delta_2^0$ degrees, that the FIP degrees are precisely the ones that bound 1generic degrees. We could hope that this characterization extends to the general hyperimmune case, since hyperimmune degrees resemble $\Delta^0_2$ ones. However, we can also show that there is a minimal $\Delta_3^0$ FIP degree. This last result has some technical complexity as it is a full approximation argument constructing a hyperimmune $\Delta_3^0$ degree, which does not seem to have occurred in the literature hitherto. Joint work with Diamondstone, Greenberg, and Turetsky.
Kikyo and Shelah showed that if $T$ is a firstorder theory in some language $L$ with the strictorder property, then the theory $T_\sigma$, which is the old theory $T$ together with an $L$automorphism $\sigma$, does not have a model companion in $L_\sigma$, which is the old language $L$ together with a new unary predicate symbol $\sigma$. However, it turns out that if we add more restrictions on the automorphism, then $T_\sigma$ can have a model companion in $L_\sigma$. I will show some examples of this phenomenon in two different context — the linear orders and the ordered abelian groups. In the context of the linear orders, we even have a complete characterization of all model complete theories extending $T_\sigma$ in $L_\sigma$. This is joint work with Chris Laskowski.
In his 1921 book the Tractatus, Wittgenstein proposed that every sentence of a language can be represented as the joint denial of some "specifiable" multiplicity of sentences. Such a representation would determine wellfounded ancestries for all sentences, terminating only in sentences whose truthconditions are fixed independently. The complexity of languages which can be analyzed in this way depends on the strength of the condition that a multiplicity of sentences be specifiable. A natural suggestion is that a multiplicity is specifiable if it is r.e. However, this leads to a computationally intractable syntax. So, we develop a finer analysis of specifiability, based on schematization and iterated substitution. The resulting system strictly extends FOL=, in particular by expressing the concept of transitive closure. This is work in progress, and we conclude with some open questions.

Links
Archives 