Videos and presentation materials from other INI events are also available.
Event  When  Speaker  Title  Presentation Material 

HIFW01 
24th August 2015 10:00 to 11:00 
101 Years of Modern Set Theory: Felix Hausdorff's "Foundations of Set Theory"
Felix Hausdorff's 1914 monograph "Grundzüge der Mengenlehre" (Foundations
of Set Theory) marks the beginning of modern set theory:
 it is the first comprehensive presentation of set theory as a mature and
rich mathematical field, untroubled by philosophical worries about
infinity and paradoxes;
 it introduces fundamental notions and theories that have been crucial
for the further development of set theory and its applications, notably
the axioms for topological spaces;
 even today, a considerable part of research in set theory has direct
links to Hausdorff's work.
In my talk I shall describe Hausdorff's book and locate it in the history
of set theory. I shall also present his views on the foundations of
mathematics and set theory.


HIFW01 
24th August 2015 11:30 to 12:30 
The tree property (session 1)
The tree propperty at $\kappa$ says that every tree of height $\kappa$ and levels of size less than $\kappa$ has a cofinal branch. A long term project in set theory is to get the consistency of the tree property at every regular cardinal greater than $\aleph_1$. So far we only know that it is possible to have the tree property up to $\aleph_{\omega+1}$, due to Neeman. The next big hurdle is to obtain it both at $\aleph_{\omega+1}$ and $\aleph_{omega+2}$ when $\aleph_\omega$ is trong limit. Doing so would require violating the singular cardinal hypothesis at $\aleph_omega$.
In this tutorial we will start with some classic facts about the tree property, focusing on branch lemmas, successors of singulars and Prikry type forcing used to negate SCH. We will then go over recent developments including a dichotomy theorem about which forcing posets are good candidates for getting the tree property at $\aleph_{\omega+1}$ together with not SCH at $\aleph_\omega$. Finally, we will discuss the problem of obtaining the tree property at the first and double successors of a singular cardinal simultaneously.


HIFW01 
24th August 2015 13:30 to 14:00 
What is a forcing extension (of V)?
Recent research into the representability of forcing extensions within ground models has often focussed on semantic formulations; we find definable class models within V that express very closely what it means to be a forcing extension of V (such as Hamkins' Naturalist Account of Forcing). In this paper, I argue that while this formulation appears to be a good candidate for interpreting forcing over V, it is problematic in that it is unable to interpret theorems concerning objects below a measurable cardinal whilst keeping the ultrapower wellfounded, and also encounters difficulties in interpreting class forcings. Instead I suggest that the motivation of a strong class theory (such as MK) over V, combined with a syntactic approach to forcing in a strengthened logic, is able to provide an interpretation of various forcing constructions which does not encounter these difficulties.


HIFW01 
24th August 2015 13:30 to 14:00 
A generalisation of closed unbounded sets
A generalisation of stationarity, associated with stationary reflection, was introduced in [1]. I give an alternative characterisation of these $n$stationary sets by defining a generalisation of closed unbounded (club) sets, so an $n$stationary set is defined in terms of these $n$clubs in the usual way. I will then look into what familiar properties of stationary and club sets will still hold in this more general setting, and explore the connection between these concepts and indescribable cardinals. Many of the simpler properties generalise completely, but for others we need an extra assumption. For instance to generalise the splitting property of stationary sets we have: If $\ kappa$ is $\ Pi^1$ $n$$1$ indescribable, then any $n$stationary subset of $\kappa$ is the union of $\ kappa$ many pairwisedisjoint $n$stationary sets. In $L$ these properties generalise straightforwardly as there any cardinal which admits an $n$stationary set is $\ Pi^1_{n1}$ indescribable [1] .
If there is time I will also introduce a generalisation of ineffable cardinals and a weak $\diamond$ principal that is associated. [1] J. Bagaria, M. Magidor, and H. Sakai. Reflection and indescribability in the constructible universe. $\textit{Israel Journal of Mathematics}$, to appear (2012). 

HIFW01 
24th August 2015 14:00 to 14:30 
A Blaszczyk 
Topological representation of lattice homomorphisms
Wallman proved that if $\mathbb{L}$ is a distributive lattice with $\mathbf{0}$ and $\mathbf{1}$, then there is a $T_1$space with a base (for closed subsets) being a homomorphic image of $\mathbb{L}$. We show that this theorem can be extended over homomorphisms. More precisely: if $\bf{Lat}$ denotes the category of normal and distributive lattices with $\mathbf{0}$ and $\mathbf{1}$ and homomorphisms, and $\bf{Comp}$ denotes the category of compact Hausdorff spaces and continuous mappings, then there exists a contravariant functor $\mathcal{W}:\bf{Lat}\to\bf{Comp}$. When restricted to the subcategory of Boolean lattices this functor coincides with a wellknown Stone functor which realizes the Stone Duality. The functor $\mathcal{W}$ carries monomorphisms into surjections.
However, it does not carry epimorphisms into injections.
The last property makes a difference with the Stone functor.
Some applications to topological constructions are given as well.


HIFW01 
24th August 2015 14:00 to 14:30 
Hyperclass Forcing in Morse Kelley Set Theory
There are mainly two different types: setforcing and classforcing, where the forcing notion is a set or class respectively. Here, we want to introduce and study the next step in this classification by size, namely hyperclassforcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of MorseKelley class theory, called MK$^*$.
We define this forcing by using a symmetry between MK$^*$ models and models of ZFC$^$ plus there exists a strongly inaccessible cardinal (called SetMK$^*$). We develop a coding between $\beta$models $\mathcal{M}$ of MK$^*$ and transitive models $M^+$ of SetMK$^*$ which will allow us to go from $\mathcal{M}$ to $M^+$ and vice versa. So instead of forcing with a hyperclass in MK$^*$ we can force over the corresponding SetMK$^*$ model with a class of conditions. For classforcing to work in the context of ZFC$^$ we show that the SetMK$^*$ model $M^+$ can be forced to look like $L_{\kappa^*}[X]$, where $\kappa^*$ is the height of $M^+$, $\kappa$ strongly inaccessible in $M^+$ and $X\subseteq\kappa$. Over such a model we can apply classforcing and we arrive at an extension of $M^+$ from which we can go back to the corresponding $\beta$model of MK$^*$, which will in turn be an extension of the original $\mathcal{M}$. We conclude by giving an application of this forcing in sho
wing that every $\beta$model of MK$^*$ can be extended to a minimal $\beta$model of MK$^*$ with the same ordinals.


HIFW01 
24th August 2015 15:00 to 16:00 
A D Törnquist 
Around the definability of mad families
I will talk about my new proof that there are no analytic infinite mad (maximal almost disjoint) families of subsets of $\omega$, a result originally proved by A.D.R. Mathias in his famous "Happy Families" paper. The new proof motivates a proof that there are no infinite mad families in Solovay's model. If time permits, I will also talk about the differences between mad families of subsets of $\omega$ and other types of mad families, such as eventually different families of functions from $\omega$ to $\omega$, and why these problems may be very different from the situation presented by mad families of subsets of $\omega$.


HIFW01 
24th August 2015 16:00 to 17:00 
The Hurewicz dichotomy for generalized Baire spaces
By classical results of Hurewicz, Kechris and SaintRaymond, an analytic subset of a Polish space X is covered by a Ksigma subset of X if and only if it does not contain a closedinX subset homeomorphic to the Baire space omega^omega. We consider the analogous statement (which we call Hurewicz dichotomy) for Sigma11 subsets of the generalized Baire space kappa^kappa for a given uncountable cardinal kappa with kappa=kappa^(<kappa), and show how to force it to be true in a cardinal and cofinality preserving extension of the ground model. Moreover, we show that if the GCH holds, then there is a cardinal preserving class forcing extension in which the Hurewicz dichotomy for Sigma11 subsets of kappa^kappa holds at all uncountable regular cardinals kappa, while strongly unfoldable and supercompact cardinals are preserved. On the other hand, in the constructible universe L the dichotomy for Sigma11 sets fails at all uncountable regular cardinals, and the same happens in any generic extension obtained by adding a Cohen real to a model of GCH. This is joint work with Philipp Lücke and Luca Motto Ros.


HIFW01 
25th August 2015 09:00 to 10:00 
P Koellner 
The Search for Deep Inconsistency
The hierarchy of large cardinals provides us with a canonical means to climb the hierarchy of consistency strength. There have been any purported inconsistency proofs of various large cardinal axioms. For example, there have been many proofs purporting to show that measurable cardinals are inconsistent. But to date the only proofs that have stood the test of time are those which are rather transparent and simple, the most notable example being Kunen's proof showing that Reinhardt cardinals are inconsistent. The Kunen result, however, makes use of AC. And long standing open question is whether Reinhardt cardinals are consistent in the context of ZF.
In this talk I will survey the simple inconsistency proofs and then raise the question of whether perhaps the large cardinal hierarchy outstrips AC, passing through Reinhardt cardinals and reaching far beyond. There are two main motivations for this investigation. First, it is of interest in its own right to determine whether the hierarchy of consistency strength outstrips AC. Perhaps there is an entire "choicless" large cardinal hierarchy, one which reaches new consistency strengths and has fruitful applications. Second, since the task of proving an inconsistency result becomes easier as one strengthens the hypothesis, in the search for a deep inconsistency it is reasonable to start with outlandishly strong large cardinal assumptions and then work ones way down. This will lead to the formulation of large cardinal axioms (in the context of ZF) that start at the level of a Reinhardt cardinal and pass upward through Berkeley cardinals (due to Woodin) and far beyond. Bagaria, Woodin, and myself have been charting out this new hierarchy. I will discuss what we have found so far.


HIFW01 
25th August 2015 10:00 to 11:00 
Local Ramsey Theory in abstract spaces
We study the notion of semiselectiviy for coideals of the space of infinite sets of natural numbers, and propose a generalization to abstract Ramsey spaces. We also consider the corresponding forcing notions. Abstract Ramsey spaces in the sense of Todorcevic [1] provide a general framework that unifies several Ramsey type results.
[1] Todorcevic, S. Introduction to Ramsey spaces. Princeton University Press, 2010.


HIFW01 
25th August 2015 11:30 to 12:30 
The tree property (session 2)
The tree propperty at $\kappa$ says that every tree of height $\kappa$ and levels of size less than $\kappa$ has a cofinal branch. A long term project in set theory is to get the consistency of the tree property at every regular cardinal greater than $\aleph_1$. So far we only know that it is possible to have the tree property up to $\aleph_{\omega+1}$, due to Neeman. The next big hurdle is to obtain it both at $\aleph_{\omega+1}$ and $\aleph_{omega+2}$ when $\aleph_\omega$ is trong limit. Doing so would require violating the singular cardinal hypothesis at $\aleph_omega$.
In this tutorial we will start with some classic facts about the tree property, focusing on branch lemmas, successors of singulars and Prikry type forcing used to negate SCH. We will then go over recent developments including a dichotomy theorem about which forcing posets are good candidates for getting the tree property at $\aleph_{\omega+1}$ together with not SCH at $\aleph_\omega$. Finally, we will discuss the problem of obtaining the tree property at the first and double successors of a singular cardinal simultaneously.


HIFW01 
25th August 2015 13:30 to 14:00 
Generic I0 at $\aleph_\omega$
It is common practice to consider the generic version of large cardinals defined with an elementary embedding, but what happens when such cardinals are really large? The talk will concern a form of generic I0 and the consequences of this extravagant hypothesis on the "largeness" of the powerset of $\aleph_\omega$. This research is a result of discussions with Hugh Woodin.


HIFW01 
25th August 2015 14:00 to 14:30 
Forcing, regularity properties and the axiom of choice
We consider general regularity properties associated with Suslin ccc forcing notions. By Solovay's celebrated work, starting from a model of $ZFC+$"There exists an inaccessible cardinal", we can get a model of $ZF+DC+$"All sets of reals are Lebesgue measurable and have the Baire property". By another famous result of Shelah, $ZF+DC+$"All sets of reals have the Baire property" is equiconsistent with $ZFC$. This result was obtained by isolating the notion of "sweetness", a strong version of ccc which is preserved under amalgamation, thus allowing the construction of a suitably homogeneous forcing notion.
The above results lead to the following question: Can we get a similar result for nonsweet ccc forcing notions without using an inaccessible cardinal?
In our work we give a positive answer by constructing a suitable ccc creature forcing and iterating along a nonwellfounded homogeneous linear order. While the resulting model satisfies $ZF+\neg AC_{\omega}$, we prove in a subsequent work that starting with a model of $ZFC+$"There is a measurable cardinal", we can get a model of $ZF+DC_{\omega_1}$. This is joint work with Saharon Shelah.


HIFW01 
25th August 2015 14:00 to 14:30 
S Friedman 
Forcing failures of covering in HOD
Inspired by questions about the HOD dichotomy, we consider how and in what manner we can force HOD to be "far from V". Our initial result is an equiconsistency in ZFC between a model with a proper class of measurable cardinals and HOD and V agreeing on the cardinals yet disagreeing on the cofinality of a proper class of cardinals.


HIFW01 
25th August 2015 15:00 to 16:00 
Symmetries
Abstract: In the last years there has been a second boom of the technique of forcing with side conditions (see for instance the recent works of AsperóMota, Krueger and Neeman describing three different perspectives of this technique). The first boom took place in the 1980s when Todorcevic discovered a method of forcing in which elementary substructures are included in the conditions of a forcing poset to ensure that the forcing poset preserves cardinals. More than twenty years later, Friedman and Mitchell independently took the first step in generalizing the method from adding small (of size at most the first uncountable cardinal) generic objects to adding larger objects by defining forcing posets with finite conditions for adding a club subset on the second uncountable cardinal. However, neither of these results show how to force (with side conditions together with another finite set of objects) the existence of such a large object together with the continuum being small. In the first part of this talk I will discuss new results in this area. This is joint work with John Krueger improving the symmetric CH preservation argument previously made by Asperó and Mota. In the second part of this talk I will use generalized symmetric systems in order to prove that, for each regular cardinal k, there is a poset $P_k$ forcing the existence of a (k,k++)superatomic boolean algebra. This is joint work with William Weiss inspired in an unpublished note from September 2009 where Asperó and Bagaria introduced the forcing $P_{\omega}$.


HIFW01 
25th August 2015 16:00 to 17:00 
P Holy 
Failures of the Forcing Theorem
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability of the forcing relation and the truth lemma can fail for class forcing. We will also present positive results about and characterizations of the forcing theorem in class forcing.
This is joint work with Regula Krapf, Philipp Lücke, Ana Njegomir and Philipp Schlicht.


HIFW01 
26th August 2015 09:00 to 10:00 
Hausdorff Medal Award  
HIFW01 
26th August 2015 10:00 to 11:00 
Hausdorff Medal Lecture  
HIFW01 
26th August 2015 11:30 to 12:30 
The tree property (session 3)
The tree propperty at $\kappa$ says that every tree of height $\kappa$ and levels of size less than $\kappa$ has a cofinal branch. A long term project in set theory is to get the consistency of the tree property at every regular cardinal greater than $\aleph_1$. So far we only know that it is possible to have the tree property up to $\aleph_{\omega+1}$, due to Neeman. The next big hurdle is to obtain it both at $\aleph_{\omega+1}$ and $\aleph_{\omega+2}$ when $\aleph_\omega$ is trong limit. Doing so would require violating the singular cardinal hypothesis at $\aleph_\omega$.
In this tutorial we will start with some classic facts about the tree property, focusing on branch lemmas, successors of singulars and Prikry type forcing used to negate SCH. We will then go over recent developments including a dichotomy theorem about which forcing posets are good candidates for getting the tree property at $\aleph_{\omega+1}$ together with not SCH at $\aleph_\omega$. Finally, we will discuss the problem of obtaining the tree property at the first and double successors of a singular cardinal simultaneously.


HIFW01 
26th August 2015 13:30 to 14:00 
D Ikegami 
Universally Baire subsets of $2^{\kappa}$
In this talk, we present a basic theory of universally Baire subsets of $2^{\kappa}$ which generalize that of universally Baire sets of reals due to Feng, Magidor, and Woodin. This is joint work with Matteo Viale.


HIFW01 
26th August 2015 13:30 to 14:00 
Cofinalities of Marczewski Ideals
We study the cofinality number of sigmaideals related to the Marczewskiideal on the Baire and Cantor space. These ideals are not Borelgenerated, and the cofinality number is usually greater than the continuum.
This is joint work with Jörg Brendle and Wolfgang Wohofsky. 

HIFW01 
26th August 2015 14:00 to 14:30 
Partition Relation Equiconsistent with $\exists \kappa(o(\kappa) = \kappa^+)$
Preamble: In this work we deal with partition relations
with infinite exponents under $ZFC$, hence all results are limited
to definable functions.
In [78], M. Spector has proven, basically, that
$\exists \kappa(o(\kappa) = 1)$ is equiconsistent with
$\aleph_1 \rightarrow (\omega)^{\omega}_{\aleph_0}$.
In [87], we were able to show that the result generalizes to $n = 2$;
namely, $\exists \kappa(o(\kappa) = 2)$ is equiconsistent with
$\aleph_1 \rightarrow (\omega^2)^{\omega^2}_{\aleph_0}$.
Surprisingly at first sight, this property cannot be generalized further (for $n> 2$), and later on we were able to prove that
$\aleph_1 \rightarrow (\omega^3)^{\omega^3}_{\aleph_0}$
is equiconsistent with $\exists \kappa(o(o(\kappa)) = 2)$.
The above lead us to a finer notion of homogeneity:
Definition: Weak Homogeneity is the partition property
$\kappa \xrightarrow{\text{\tiny WH}}(\lambda)^{\eta}_{\mu}$
where the only considered subsequences of $\lambda$
are those that are created by removing (or, complementarily, collecting) only finitely many segments of $\lambda$.
Using week homogeneity we were able to prove the following
for any ordinal $\alpha$ [87]: $\exists \kappa(o(\kappa) = \alpha)$
is equiconsistent with
$\aleph_1 \xrightarrow{\text{\tiny WH}}(\omega^\alpha)^{\omega^\alpha}_{\aleph_0}$.
Later on we were able to characterize the consistency strength of
$\exists \kappa(o(\kappa)~=~\kappa)$, and recently we have arrived at
the main result of this paper:
$\exists \kappa(o(\kappa) = \kappa^+)$ is equiconsistent with
$\aleph_1 \xrightarrow{\text{\tiny WH}}(\aleph_1)^{\aleph_1}_{\aleph_0}$
References:
[78] M. Spector: Natural Sentences of Mathematics which are
independent of $V = L$, $V = L^\mu$ etc., 1978 (preprint).
[87] Y.M. Kimchi: Dissertation, 1987, The Hebrew University of Jerusalem, Israel


HIFW01 
26th August 2015 14:00 to 14:30 
On the class of perfectly null sets and its transitive version
The ideals of universally null sets (UN, sets which are null with respect to any Borel diffused measure) and perfectly meager sets (PM, sets which are meager when restricted to any perfect set) are best known among the classes of special subsets of the real line. Those two ideals were long considered to be somehow dual, though some differences were also known. P. Zakrzewski proved that two other earlier defined classes of sets smaller then PM coincide and are dual to UN. Therefore he proposed to call this class universally meager sets. The PM class was left without a counterpart, and we try to define a class of sets which may play the role of a dual class to PM and we also consider its transitive version. I will present some properties of those classes and give few important problems which are still open.


HIFW01 
27th August 2015 09:00 to 10:00 
Mathias and Set Theory On Mathias Day, the life work of Adrian Mathias in set theory will be surveyed and celebrated, in full range and extent. 

HIFW01 
27th August 2015 10:00 to 11:00 
C Delhomme 
The relation of attack
When he visited Barcelona, Adrian Mathias got interested in questions regarding the relation of attack considered by dynamicists.
Given a selfmapping of a topological space, a point x attacks y, or y is an omegalimit point of x, if y is a cluster point of the sequence of iterates of x.
He successfully applied settheoretical ideas in the study of this relation.
We shall describe some of his contributions to the subject.


HIFW01 
27th August 2015 11:30 to 12:30 
Happy Families and Their Relatives
We first recall the notion of $\ happy$$\ families$ as well as their combinatorial properties. Then we present some families which are related to $\ happy$$\ families$ and investigate $\ Mathias$$\ forcing$ restricted to these families. In the second part we show
the relation between $\it Mathias$$\ forcing$ and the $\ Ramsey$$\ property$ and discuss the still open problem whether one can take $\ Mathias'$$\ inaccessible$ away. In the last part, we sketch Shelah's construction of a model of ZFC in which there are exactly $\ 70$$\ happy$$\ ultrafilters$.


HIFW01 
27th August 2015 13:30 to 14:00 
Selective properties of ideals
We will discuss several selective properties of ideals on countable sets. In the case of maximal ideals all those properties coincide and are equivalent to the notion of selectiveness of a maximal ideal (a maximal ideal is selective iff its dual filter is a Ramsey ultrafilter), however in general those selective properties differ from each other. We will show some of their connections to ideal convergence of sequences of functions, descriptive complexity of ideals and topological ways of representing ideals.


HIFW01 
27th August 2015 13:30 to 14:00 
Connecting topological dimension theory and recursion theory
We introduce the point degree spectrum of a represented spaces as a substructure of the Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees, continuous degrees, and so on.
The point degree spectrum connects descriptive set theory, topological dimension theory and computability theory.
Through this new connection, for instance, we construct a family of continuum many infinite dimensional Cantor manifolds possessing Haver's property C whose Borel structures at an arbitrary finite rank are mutually nonisomorphic, which strengthen various theorems in infinite dimensional topology such as Roman Pol's solution to Pavel Alexandrov's old problem.


HIFW01 
27th August 2015 14:00 to 14:30 
Chain conditions, layered partial orders and weak compactness
Motivated by a conjecture of Todorcevic, we study strengthenings of the $\kappachain$ conditions that are equivalent to the $\kappachain$ condition in the case where $\kappa$ is a weakly compact cardinal. We then use such properties to provide new characterizations of weakly compact cardinals. In addition, we show that the question whether weak compactness is characterized by the statement that all $\kappaKnaster$ posets satisfy these properties is independent from the axioms of ZFC. This is joint work with Sean D. Cox (VCU Richmond).


HIFW01 
27th August 2015 15:00 to 16:00 
G Fuchs 
Prikry type sequences: a composition of interconnected results
I would like to survey a series of beautiful and almost mysterious properties of Prikry sequences which have analogues for other Prikry type forcings. The first of these is Mathias' characterization of Prikry sequences as those that are almost contained in every set of measure 1 with respect to the normal ultrafilter being used for the forcing. This is the key to the second property, which is that the sequence of critical points when forming iterated ultrapowers by that ultrafilter is a Prikry sequence over the limit model. Using this, it is not hard to conclude that Prikry sequences are maximal, in the sense that they almost contain every other Prikry sequence present in their forcing extension. Another phenomenon is that the forcing extension of the limit model by the critical sequence is the same as the intersection of the finite iterates. I will show another canonical representation of that model. Yet another property is that the limit model can be realized as a single Boolean ultrapower. Most of these results were known for Prikry forcing, and I will show that some of them carry over to certain variants of Prikry forcing and Magidor forcing.


HIFW01 
27th August 2015 16:00 to 17:00 
A superDowker filter
A superDowker filter is a filter F on a set X such that
1) For every sequence 

HIFW01 
28th August 2015 09:00 to 10:00 
Infinite dimensional Ellentuck spaces Topological Ramsey spaces have proved essential to solving certain problems in Banach spaces, Graph Theory, Set Theory, and Topology. In recent years, they have provided a mechanism for investigating initial RudinKeisler and Tukey structures in the StoneCech compactification of the natural numbers. In work of Dobrinen and Todorcevic and work of Dobrinen, Mijares, Trujillo, certain partial orders which force ultrafilters with partition relations were found to be equivalent to some new classes of topological Ramsey spaces. These in turn were used to precisely investigate the Ramseytheoretic properties and the Tukey and RudinKeisler structures of the associated ultrafilters. The Ellentuck space is the quintessential example of a topological Ramsey space. It is closely connected with Mathias forcing and with $\mathcal{P}(\omega)/\mathrm{Fin}$ which forces a Ramsey ultrafilter. Building on work in [Blass/Dobrinen/Raghavan15] investigating the Tukey type of the ultrafilter forced by $\mathcal{P}(\omega\times\omega)/\mathrm{Fin}\otimes\mathrm{Fin}$, we found in [DobrinenJSL15] that the essential structure responsible for the forcing properties actually is a 2dimensional version of the Ellentuck space. In this talk, we will present work in [DobrinenIDE15] constructing a new class of topological Ramsey spaces which may be viewed as infinite dimensional Ellentuck spaces. We will then present the Ramseyclassification theorems for equivalence relations on fronts and some applications to their related $\sigma$closed forcings and the RudinKeisler and Tukey structures below the generic ultrafilters.


HIFW01 
28th August 2015 10:00 to 11:00 
M Goldstern 
Ultrafilters without ppoint quotients
A ppoint is a nonprincipal ultrafilter on the set N of natural numbers
which has the property that for every countable family of filter sets
there is a pseudointersection in the filter, i.e. a filter set which
is almost contained in each set of the family. Equivalently, a
ppoint is an element of the StoneCech remainder beta(N) minus N
whose neighborhood filter is closed under countable intersections.
It is well known that ppoints "survive" various forcing iterations,
that is: extending a universe V with certain forcing iterations P
will result in a universe V' in which all (or at least: certain
wellchosen) ppoints are still ultrafilter bases in the extension.
This shows that the sentence "The continuum hypothesis is false,
yet there are aleph1generated ultrafilters, namely: certain
ppoints" is relatively consistent with ZFC.
In a joint paper with Diego Mejia and Saharon Shelah (still in
progress) we construct ultrafilters on N which are, on the
one hand, far away from being ppoints (there is no RudinKeisler
quotient which is a ppoint), but on the other hand can
survive certain forcing iterations adding reals but killing
ppoints. This shows that nonCH is consistent with
small ultrafilter bases AND the nonexistence of ppoints.


HIFW01 
28th August 2015 11:30 to 12:30 
L Zdomskyy 
Delta_1definability of the nonstationary ideal
The talk will be devoted to the proof of the fact that assuming $V = L$, for every successor cardinal $\kappa$ there exists a GCH and cardinal preserving forcing poset $P \in L$ such that in $L^P$ the ideal of all nonstationary subsets of $\kappa$ is
$\Delta_1$definable over $H(\kappa^+)$. We shall also discuss the situation for limit $\kappa$.


HIFW01 
28th August 2015 13:30 to 14:00 
M Staniszewski 
On ideal equal convergence
We consider ideal equal convergence of a sequence of functions.
This is a generalization of equal convergence introduced by
Cs\'{a}sz\'{a}r and Laczkovich. The independent, equivalent definition was introduced by Bukovsk{\'a}. She called it quasinormal convergence. We study relationships between ideal equal convergence and various kinds of ideal convergences of sequences of real functions.
We prove a characterization showing when the ideal pointwise
convergence does not imply the ideal equal (aka quasinormal) convergence. The characterization is expressed in terms of a cardinal coefficient related to the bounding number. Furthermore we consider ideal version of the bounding number on sets from coideals.


HIFW01 
28th August 2015 14:00 to 14:30 
The size of conjugacy classes of automorphism groups
The automorphism groups of Fraissé limits are usually interesting objects both from group theoretic and set theoretic viewpoint. However, these groups are often nonlocally compact, hence there is no natural translation invariant measure on them.
Christensen introduced the notion of Haar null sets in nonlocally compact Polish groups which is a wellbehaved generalisation of the null ideal to such groups.
In my talk I will present some new results concerning the size of the conjugacy classes of automorphism groups of Fraisse limits with respect to this notion.


HIFW01 
28th August 2015 15:00 to 16:00 
Y Zhu 
The higher sharp
We establish the descriptive set theoretic representation of the mouse $M_n^\#$, which is called $0^{(n+1)\#}$. At even levels, $0^{(2n)\#}$ is the higher level analog of Kleene's O; at odd levels, $0^{(2n+1)\#}$ is the unique iterable remarkable level$(2n+1)$ blueprint.


HIFW01 
28th August 2015 16:00 to 17:00 
Indestructible remarkable cardinals
In 2000, Schindler introduced remarkable cardinals and showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Remarkable cardinals can be thought of either as a miniature version of strong cardinals or as having aspects of generic supercompactness, but they are relatively low in the large cardinal hierarchy. They are downward absolute to $L$ and lie (consistencywise) between the 1iterable and 2iterable cardinals of the $\alpha$iterable cardinals hierarchy (below Ramsey cardinals). I will discuss the indestructibility properties of remarkable cardinals, which are similar to those of strong cardinals. I will show that a remarkable cardinal $\kappa$ can be made simultaneously indestructible by all $\lt\kappa$closed $\leq\kappa$distributive forcing and by all forcing of the form ${\rm Add}(\kappa,\theta)*\mathbb R$, where $\mathbb R$ is forced to be $\lt\kappa$closed and $\leq\kappa$distributive. For this argument, I will introduce the notion of a remarkable Laver function and show that every remarkable cardinal has one. Although, the existence of Laverlike functions can be forced for most large cardinals, few, such as strong, supercompact, and extendible cardinals, have them outright. The established indestructibility can be used to show, for instance, that any consistent continuum pattern on the regular cardinals can be realized above a remarkable cardinal and that a remarkable cardinal need not be even weakly compact in ${\rm HOD}$. This is joint work with Yong Cheng.


HIFW04 
1st September 2015 13:00 to 14:00 
A look into generalised stability  
HIFW04 
1st September 2015 14:00 to 15:00 
In Pursuit of the Missing Premise in First Order Logic  
HIFW04 
1st September 2015 15:30 to 16:30 
Models of Intuitionistic ZermeloFrankel Set Theory based on Scott's $D_{\infty}$  
HIFW04 
1st September 2015 16:30 to 17:30 
D Siniora  Generic Automorphisms of a Hrushovski construction  
HIFW04 
2nd September 2015 10:00 to 11:00 
An application of Model Theory to Real Algebraic Geometry  
HIFW04 
2nd September 2015 11:30 to 12:30 
Applying constructive analysis and topology in game theory  
HIFW04 
2nd September 2015 13:30 to 14:40 
A Blass  Weak Partition Relations and Conservative Elementary Extensions  
HIFW04 
2nd September 2015 14:40 to 15:10 
AEC tameness from large cardinals via category theory  
HIFW04 
2nd September 2015 14:40 to 15:10 
E Rivello  Selfdetermined sets of sentences  
HIFW04 
2nd September 2015 15:10 to 15:40 
A variant of $\Pi^0_1$ class  
HIFW04 
2nd September 2015 15:10 to 15:40 
S Uckelman  Where are the women in medieval logic?  
HIFW04 
2nd September 2015 16:00 to 17:00 
A Kurucz  Manydimensional Modal Logics  
HIFW04 
3rd September 2015 09:00 to 10:00 
Descriptive Graph Combinatorics  
HIFW04 
3rd September 2015 10:00 to 11:00 
M Sadrzadeh  A Multilinear Algebraic Semantics for Natural Language  
HIFW04 
3rd September 2015 11:20 to 12:20 
Descriptive set theory, endofunctors & hypercomputation  
HIFW04 
3rd September 2015 13:30 to 14:30 
Extending the Syllogistic  
HIFW04 
3rd September 2015 14:40 to 15:10 
On a Generalization of the Revisiontheoretic Approach to Strategic Rationality  
HIFW04 
3rd September 2015 15:10 to 15:40 
Firstorder Proofs Without Syntax  
HIFW04 
3rd September 2015 15:10 to 15:40 
Partition Relation for linear Orders without the Axiom of Choice  
HIFW04 
3rd September 2015 15:40 to 16:00 
Coffee Break  
HIFW04 
3rd September 2015 16:00 to 17:00 
Ehrenfeucht Principles in Set Theory  
HIFW04 
4th September 2015 09:00 to 10:00 
Local Names  
HIFW04 
4th September 2015 10:10 to 10:40 
P Ehrlich  Integration on the Surreals  
HIFW04 
4th September 2015 10:10 to 10:40 
R Lubarsky  Feedback Computability  
HIFW04 
4th September 2015 10:40 to 11:10 
QBF proof complexity  
HIFW04 
4th September 2015 10:40 to 11:10 
Computably extendible order types  
HIFW04 
4th September 2015 11:30 to 12:30 
Forcing with large continuum  
HIFW04 
4th September 2015 13:30 to 14:30 
Constructing Quasiminimal Functions  
HIF 
8th September 2015 15:00 to 16:00 
Another proof of the failure of a higher forcing axiom  
HIF 
10th September 2015 15:00 to 16:00 
On the width of wqos  
HIF 
15th September 2015 15:00 to 16:00 
R Lubarsky  $\Sigma^0_3$ determinacy and friends  
HIF 
17th September 2015 15:00 to 16:00 
Linking set theory to economics  
HIF 
29th September 2015 15:00 to 16:00 
Modal logics of the generic multiverse  
HIF 
29th September 2015 16:00 to 17:00 
Aspects of generalizing the concept of strong measure zero  
HIF 
1st October 2015 15:00 to 16:00 
The Silence  
HIF 
5th October 2015 16:00 to 17:00 
H Woodin 
Beyond the infinite: Rothschild Distinguished Visiting Professor Lecture
The modern mathematical story of infinity began in the period 187984 with a series of papers by Cantor that defined the fundamental framework of the subject. Within 40 years the key ZFC axioms for Set Theory were in place and the stage was set for the detailed development of transfinite mathematics, or so it seemed. However, in a completely unexpected development, Cohen showed in 1963 that even the most basic problem of Set Theory, that of Cantor's Continuum Hypothesis, was not solvable on the basis of the ZFC axioms.
The 50 years since Cohen's work has seen a vast development of Cohen's method and the realization that the occurrence of unsolvable problems is ubiquitous in Set Theory. This arguably challenges the very conception of Cantor on which Set Theory is based. Thus a fundamental dilemma has emerged. On the one hand, the discovery, also over the last 50 years, of a rich hierarchy axioms of infinity seems to argue that Cantor's conception is fundamentally sound. But on the other hand, the developments of Cohen's method over this same period seem to strongly suggest there can be no preferred extension of the ZFC axioms to a system of axioms that can escape the ramifications of Cohen's method. But this dilemma was itself based on a misconception and recent discoveries suggest there is a resolution. 

HIF 
6th October 2015 15:00 to 16:00 
Reversibility of Definable Relations  
HIF 
9th October 2015 12:30 to 13:25 
H Nobrega 
Computable analysis and games in descriptive set theory
We report on ongoing work with Arno Pauly, showing how concepts from computable analysis can be used to shed light and uniformize certain games for classes of functions which have been studied in descriptive set theory, such as Wadge's game for continuous functions, Duparc's eraser game for Baire class 1 functions, and Semmes' tree game for Borel functions.
As an application, for each finite n we obtain a game characterizing the Baire class n of functions. 

HIF 
9th October 2015 13:30 to 14:25 
MinMax theorems in infinite combinatorics
The start of my talk is the extension of the marriage theorem to infinite bipartite graphs due to Aharoni, NashWilliams and Shelah. This is implied by the Infinite Menger Conjecture, which was proved recently by Aharoni and Berger. Next I will talk about related packing and covering conjectures in infinite graphs.
Then I will give a short introduction to infinite matroids. The matroidal point of view allows us to understand the above statements as different perspectives or special cases of the same central problem of Infinite Matroid Theory, which can be traced back to NashWilliams. At the end, I will mention a link between Determinacy of infinite games and that conjecture of NashWilliams. More precisely, there is a special case of the conjecture which is equivalent to the statement that a certain family of infinite games is determined if and only if a second family of infinite games is. This talk is self contained and I will not assume any special knowledge of the audience. 

HIF 
9th October 2015 14:40 to 15:35 
Saturated Boolean Ultrapowers
In this talk I will survey the general theory of Boolean ultrapowers, starting from the beginnings and including many applications and some possible future developments. Also, the settheoretic approach to Boolean ultrapowers, due to recent work of Hamkins and Seabold, will be discussed.
First developed by Mansfield as a purely algebraic construction, Boolean ultrapowers are a natural generalization of usual powerset ultrapowers. More specifically, I will focus on how some combinatorial properties of a ultrafilter U are related to the realization of types in the resulting Boolean ultrapower. Many results on $\lambda$regular and $\lambda$good ultrafilters, mostly due to Keisler, can be generalized to this context. In particular, I will sketch the construction of a $\lambda$good ultrafilter on the Levy collapsing algebra $\mathrm{Coll}(w, <\lambda)$. In addition to that, I will describe a possible application to Keisler's order on complete theories. 

HIF 
9th October 2015 15:50 to 16:45 
Uncountably many maximalclosed subgroups of Sym(N) via reducts of Henson digraphs
This work contributes to the two closely related areas of countable homogeneous structures and infinite permutation groups. In the permutation group side, we answered a question of Macpherson that asked to show that there are uncountably many pairwise nonconjugate maximalclosed subgroups of Sym(\mathbb{N}). This was achieved by taking the automorphism groups of uncountably many pairwise nonisomorphic Henson digraphs. The fact these groups are maximalclosed follows from the classification of the reducts of Henson digraphs. In itself, this classification contributes to the building list of structures whose reducts are known and also provides further evidence that Thomas' conjecture is true.
In this talk, my main aim will be to describe the construction of these continuum many maximalclosed subgroups, which will include Henson's famous construction of continuum many countable homogeneous digraphs. Any remaining time will be spent giving some of the ideas behind how we prove these groups are maximal closed.


HIF 
10th October 2015 11:00 to 11:55 
Weihrauch degrees for generalized Baire space
The theory of Weihrauch degrees is about representing classical theorems of analysis in Baire space and comparing their strength (measured as the Weihrauch degree). In this talk, we are exploring a version of this theory for generalized Baire space. The first step in this generalization is that of finding a generalization of R on which we can prove a version of theorems from classical analysis. The first part of the talk will be devoted to the presentation of the construction of an extension of R on which we can prove a version of the Intermediate Value Theorem. In the second part of the talk we will be focusing on generalizing notions from computable analysis. Finally we will show how this new framework can be used to characterize the strength of the generalized version of the version of the Intermediate Value Theorem we presented in the first half of the talk.


HIF 
10th October 2015 13:00 to 13:55 
Topological Ramsey theory of countable ordinals
Recall that the Ramsey number R(n, m) is the least k such that, whenever the edges of the complete graph on k vertices are coloured red and blue, then there is either a complete red subgraph on n vertices or a complete blue subgraph on m vertices  for example, R(4, 3) = 9. This generalises to ordinals: given ordinals $\alpha$ and $\beta$, let $R(\alpha, \beta)$ be the least ordinal $\gamma$ such that, whenever the edges of the complete graph with vertex set $\gamma$ are coloured red and blue, then there is either a complete red subgraph with vertex set of order type $\alpha$ or a complete blue subgraph with vertex set of order type $\beta$
 for example, $R(\omega + 1, 3) = \omega + 1$. We will prove the result of Erdos and Milner that $R(\alpha, k)$ is countable whenever $\alpha$ is countable and k is finite, and look at a topological version of this result. This is joint work with Andres Caicedo.


HIF 
10th October 2015 14:00 to 14:55 
P Kleppmann 
Free groups and the Axiom of Choice
The role of the Axiom of Choice in Mathematics has been studied extensively. Given a theorem of ZFC, one may ask how strong it is compared to the Axiom of Choice. Although a large collection of results has been analysed in this way, there are still simple and elegant theorems that offer resistance. One such result is the NielsenSchreier theorem, which states that subgroups of free groups are free.
I will introduce recent results that help to establish the strength of NielsenSchreier, focussing on the method of representative functions. Then I discuss potential applications of this technique to other algebraic structures admitting a basis, such as free abelian groups and vector spaces. 

HIF 
22nd October 2015 15:30 to 16:30 
Universal graphs and their variations  
HIF 
27th October 2015 15:00 to 16:00 
Dual Ramsey theory on trees  
HIF 
27th October 2015 16:00 to 17:00 
Order types of chains of Borel sets and Baire functions  
HIF 
28th October 2015 11:00 to 12:00 
N de Rancourt  Ramsey Determinacy of adversarial Gowers games  
HIF 
29th October 2015 15:00 to 16:00 
Approximate Ramsey properties of matrices and finite dimensional normed spaces
Joint work with D. Bartosova and B. Mbombo


HIF 
29th October 2015 16:00 to 17:00 
Consecutively large families below the first inaccessible cardinal  
HIF 
10th November 2015 15:00 to 16:00 
On two problems on Boolean algebras and finitely additive measures  
HIF 
17th November 2015 15:00 to 16:00 
S Fuchino  Reflection numbers of some combinatorial and topological properties  
HIF 
19th November 2015 15:00 to 16:00 
The surreal numbers  
HIF 
1st December 2015 15:00 to 16:00 
Forcing the truth of a weak form of Schanuel's conjecture  
HIF 
8th December 2015 15:00 to 16:00 
The nature of measurement in set theory
The goal of set theory, as articulated by Hugh Woodin, is develop a "convincing philosophy of truth." In his recent Rothschild address at the INI, he described the work of set theorists as falling into one of two categories: studying the universe of sets and studying models of set theory. We offer a new perspective on the nature of truth in set theory that may to some extent reconcile these two efforts into one. Joint work with Shoshana Friedman.


HIF 
10th December 2015 15:00 to 16:00 
Some more on $G_\delta\sigma$ determinacy and generalized recursion  
HIFW03 
14th December 2015 10:00 to 11:00 
Ramsey theory in topological dynamics  
HIFW03 
14th December 2015 11:30 to 12:00 
Strong Chang's Conjecture, SemiStationary Reflection, Strong Tree Property and Two Cardinal Square Principles We prove that the SemiStationary Reflection Principle, together with the negation of the Continuum Hypothesis, implies that $\omega_2$ has the Strong Tree Property. Also, we show that SSR implies the negation of $\Box(\lambda, \omega)$ for all regular cardinals $\lambda\geq\omega_2$. This is a joint work with Liuzhen Wu. 

HIFW03 
14th December 2015 13:30 to 14:30 
Approximate Ramsey properties of Matrices  
HIFW03 
14th December 2015 15:00 to 15:30 
The unreasonable effectiveness of Nonstandard Analysis The aim of my talk is to highlight a hitherto unknown computational aspect of Nonstandard Analysis. In particular, we provide an algorithm which takes as input the proof of a mathematical theorem from ‘pure’ Nonstandard Analysis, i.e. formulated solely with the nonstandard definitions (of continuity, integration, dif ferentiability, convergence, compactness, et cetera), and outputs a proof of the as sociated effective version of the theorem. Intuitively speaking, the effective version of a mathematical theorem is obtained by replacing all its existential quantifiers by functionals computing (in a specific technical sense) the objects claimed to exist. Our algorithm often produces theorems of Bishop’s Constructive Analysis ([2]). The framework for our algorithm is Nelson’s syntactic approach to Nonstandard Analysis, called internal set theory ([4]), and its fragments based on Goedel’s T as introduced in [1]. Finally, we establish that a theorem of Nonstandard Analysis has the same computational content as its ‘highly constructive’ Herbrandisation. Thus, we establish an ‘algorithmic twoway street’ between socalled hard and soft analysis, i.e. between the worlds of numerical and qualitative results.
References: [1] Benno van den Berg, Eyvind Briseid, and Pavol Safarik, A functional interpretation for non standard arithmetic, Ann. Pure Appl. Logic 163 (2012), no. 12, 1962–1994. [2] Errett Bishop and Douglas S. Bridges, Constructive analysis, Grundlehren der Mathematis chen Wissenschaften, vol. 279, SpringerVerlag, Berlin, 1985. [3] Fernando Ferreira and Jaime Gaspar, Nonstandardness and the bounded functional interpre tation, Ann. Pure Appl. Logic 166 (2015), no. 6, 701–712. [4] Edward Nelson, Internal set theory: a new approach to nonstandard analysis, Bull. Amer. Math. Soc. 83 (1977), no. 6, 1165–1198. [5] Stephen G. Simpson, Subsystems of second order arithmetic, 2nd ed., Perspectives in Logic, CUP, 2009. 

HIFW03 
14th December 2015 16:00 to 17:00 
A revision theory for typefree probability  
HIFW03 
15th December 2015 10:00 to 11:00 
On relating strong type theories and set theories
There exists a fairly tight fit between type theories à la MartinLöf and constructive set theories such as CZF and its extension, and there are connections to classical KripkePlatek set theory and extensions thereof, too. The technology for determining the (exact) prooftheoretic strength of such theories was developed in the late 20th century. The situation is rather different when it comes to type theories (with universes) having the impredicative type of propositions Prop from the Calculus of Constructions that features in some powerful proof assistants. Aczel's setsastypes interpretation into these type theories gives rise to rather unusual settheoretic axioms: negative power set and negative separation. But it is not known how to determine the consistency strength of intuitionistic set theories with such axioms via familiar classical set theories (though it is not difficult to see that ZFC plus infinitely many inaccessibles provides an upper bound). The first part of the talk will be a survey of known results from this area. The second part will be concerned with the rather special computational and prooftheoretic behavior of such theories.


HIFW03 
15th December 2015 11:30 to 12:30 
Inaccessible cardinals and accessible categories
There is a growing list of important questions in category theory, abstract homotopy theory or model theory where answers depend on large cardinals. These questions concern various properties of accessible categories which can be imagined as categories of models of infinitary first order theories. The answers depend on Vopenka's principle or its consequences, mostly on the existence of a proper class of suitable large cardinals. We will give examples of such questions, explain their characteristic features and mention open problems.


HIFW03 
15th December 2015 13:30 to 14:30 
The Pinning Down Number and Cardinal Arithmetic  
HIFW03 
15th December 2015 14:45 to 15:45 
Partition Relation Perspectives We will look at partition relations from various perspectives, and discuss recent results and open problems. 

HIFW03 
15th December 2015 16:00 to 17:00 
M Magidor  TBA  
HIFW03 
16th December 2015 10:00 to 11:00 
Wellquasiorderings for progam analysis and computational complextiy
Coauthor: Sylvain Schmitz (ENS Cachan)
The talk will survey some of the applications of wellquasiorderings in computer science.
Wellquasiorderings are an important tool in some areas like program verification, or computeraided deduction and theoremproving. Most importantly, they provide easy proofs for the decidability of logical or combinatorial problems. Recent work by the authors aim at extracting computational complexity bounds from decidability proofs that rely on wellquasiorderings.


HIFW03 
16th December 2015 11:30 to 12:00 
Infinite Matroids and Pushdown Automata on Infinite Words
The aim of this talk is to propose a topic of study that connects infinite matroids with pushdown automata on words indexed by arbitrary linear orders. The motivation for this study is the key open conjecture concerning infinite matroids, the Intersection Conjecture of NashWilliams, as well as a result from my paper "Infinite Matroidal Version of Hall's Matching Theorem, J. London Math. Soc., (2) 71 (2005), 563–578." The main result of this paper can be described using pushdown automata as follows. Let P=(M,W) be a pair of matroids on the same groundset E. We assign to P a language L_P consisting of transfinite words (indexed by ordinals) on the alphabet A={1,0,1}. The language L_P is obtained by taking all injective transfinite sequences of the elements of E and translating each such sequence f into a word of L_P. The translation involves replacing an element of f by 1, 0 or 1 depending on whether it is spanned by its predecessors in both, one or none of the matroids M and W.
Theorem There exists a pushdown automaton T on transfinite sequences in the alphabet A such that the language L_T consisting of words accepted by T has the following property: For every pair P of matroids satisfying property (*), the language L_P is a subset of L_T if and only if the pair P has a packing (the ground set E can be partitioned into sets E_M and E_N that are spanning in M and N, respectively). The property (*) is that M is either finitary or a countable union of finite corank matroids and W is finitary. 

HIFW03 
16th December 2015 12:00 to 12:30 
Weihrauch degrees of determinacy  
HIFW03 
16th December 2015 13:30 to 14:30 
Computing beyond Constructibility: The Recognizability Strength of Ordinal Time Machines
Coauthor: Philipp Schlicht (Universität Bonn)
Transfinite machine models of computation provide an approach to an `effective mathematics of the uncountable'. However, their settheoretical interest seems to be limited by the fact that even the strongest such model, Koepke's Ordinal Turing Machines with parameters (pOTMs), can only compute constructible sets.
Recognizability is a more liberal notion than computability in that it only requires the machine to be able to identify a certain object when it is given to it as an input, not to produce that object.
By invoking notions from algorithmic randomness and considering recognizability rather than computability, we connect transfinite computability to large cardinals and forcing axioms incompatible with the axiom of constructibility on the one hand and inner models for large cardinals on the other. In particular, under appropriate large cardinal assumptions, a real number is heriditarily recognizable by a pOTM if and only if it is an element of the mouse for one Woodin cardinal.
This is joint work with Philipp Schlicht.


HIFW03 
16th December 2015 15:00 to 16:00 
Long and short recursive constructionscardinal invariants and parametrized diamonds  
HIFW03 
17th December 2015 10:00 to 11:00 
Set Theory and Automata Theory
We review some recent results on links between (descriptive) set theory and automata theory. In particular, we consider the topological complexity of languages of infinite words accepted by various kinds of automata, the infinite games specified by automata, and independence results in automata theory.


HIFW03 
17th December 2015 11:30 to 12:30 
ContextDependent Deterministic Parallel Feedback Turing Computability
The limit of this kind of computability is the least ordinal which is \Pi_1 gapreflecting on admissibles. If you would like to know what any of this means, come to the talk!


HIFW03 
17th December 2015 13:30 to 14:30 
An Introduction to infinite matroids
For various questions in Infinite Graph Theory, matroids have turned out to be the right tool to tackle them. This introduction to infinite matroids will be selfcontained; in particular I will explain what a matroid is.


HIFW03 
17th December 2015 14:45 to 15:45 
Determinacy in Infinite Matroids  
HIFW03 
17th December 2015 16:00 to 17:00 
Pairwise Sums in the Reals
Coauthors: Neil Hindman (Howard University), Dona Strauss (University of Leeds)
We show (assuming CH) that there is a finite colouring of the reals such that no infinite set X has X+X (meaning the pairwise sums from X, allowing repetition) monochromatic. And we give positive results for ‘nice’ colourings.


HIFW03 
18th December 2015 10:00 to 11:00 
Another proof of the JayneRogers theorem  
HIFW03 
18th December 2015 11:30 to 12:30 
Borel Matchings and equidecompositions
We discuss several results related to the question of when a Borel graph has a Borel matching. Here, the analogue of Hall's matching theorem fails, but there are positive results giving Borel matchings in several contexts if we are willing to discard null or meager sets. We also discuss some applications to geometrical paradoxes. This is
joint work with Spencer Unger.


HIFW03 
18th December 2015 13:30 to 14:30 
Set theory and algebraic topology
In this talk I plan to discuss some joint work with Sheila Miller related to knots. Quandles are algebraic structures that can be associated to (tame) knots, and they in fact constitute one of the few complete invariants we have for knots. However, there is some dissatisfaction with quandles as invariants, as it heuristically seems difficult to determine whether two quandles are isomorphic. Our result supports this impression: we show that the isomorphism relation of quandles is as complex as it possibly could be in Borel reducibility terms, being Borel complete. On the other hand, equivalence of tame knots is trivial from a Borel reducibility perspective, raising the prospect that more manageable complete invariants might exist.
