This is the second in a series of lectures on naive descriptive set theory based on an expository paper by Matt Foreman. The topics discussed will include tree representations, universality properties of Polish spaces, and subspaces of Polish spaces.
This is the first in a series of introductory lectures in descriptive set theory, following Matt Foreman's expository paper. The topics discussed will be basics of Polish topologies, product topologies, Cantor space and Baire space, and infinite trees.
Tree properties are a family of combinatorial principles that characterize large cardinal properties for inaccessibles, but can consistently hold for "small" (successor) cardinals such as $\aleph_2$. It is a classic theorem of Magidor and Shelah that if $\kappa$ is the singular limit of supercompact cardinals, then $\kappa^+$ has the tree property. Neeman showed how to force $\kappa^+$ to become $\aleph_{\omega+1}$ while maintaining the tree property. Fontanella generalized these results to the strong tree property.
We show (in ZFC) that if $\kappa$ is a singular limit of supercompact cardinals, then $\kappa^+$ has the super tree property (this jump from "strong" to "super" is analogous to the jump in strength from strongly to supercompact cardinals). We remark on how to get the super tree property at $\aleph_{\omega+1}$, and on some interesting consequences for the existence of guessing models at successors of singulars. This is joint work with Dima Sinapova.
In this continuation of my talk from last week, I will introduce the notion of a spectral gap subalgebra of a tracial von Neumann algebra and show how it connects to the definability of relative commutants. I will also mention some applications of these results. I will introduce all notions needed from the theory of von Neumann algebras.
In this first of two talks, I will explain the notion of definability in continuous logic and connect it with the notion of spectral gap in the theory of unitary representations and in ergodic theory.
(This is joint work with Martin Pizarro). We prove that for any prime p the theory of separably closed fields of characteristic p is equational. This was known before for finite degree of imperfection.
In Ramsey Theory, ultrafilters often play an instrumental role.
By using nonstandard models of the integers, one can replace those
third-order objects (ultrafilters are families of subsets) by simple
points.
In this talk we present a nonstandard technique that is grounded
on the above observation, and show its use in proving some new results
in Ramsey Theory of Diophantine equations.
In this talk we develop iterability theory for a single measure, give an inner model theoretic representation of 0-sharp, and show how this representation leads to non-trivial embedding of L into L.
In this talk, we will continue with basics of measurable cardinals and their relationship to non-trivial elementary embeddings. We proceed with basic facts about the constructible universe, L. After laying this groundwork, we show L cannot have a measurable cardinal. Time permitting, we will discuss the dichotomy introduced by Jensen's covering lemma: either L is a good approximation to V, or there is a non-trivial elementary embedding from L to L.
How complicated are countable torsion-free abelian groups? In particular, are they as complicated as countable graphs? In recent joint work with Shelah, we show it is consistent with ZFC that countable torsion-free abelian groups are $a \Delta^1_2$ complete; in other words, countable graphs can be encoded into them via an absolutely $\Delta^1_2$-map. I discuss this, and the related result: assuming large cardinals, it is independent of ZFC if there is an absolutely $\Delta^1_2$ reduction from Graphs to Colored Trees, which takes non-isomorphic graphs to non-biembeddable colored trees.