Seminar on Reckoning

On wide Aronszajn trees

Mirna Džamonja

IHPST CNRS-Université Panthéon-Sorbonne, Paris

Seminar on Reckoning

Wednesday, 16. September 2020 - 11:00 to 15:00

Institute of Mathematics CAS, Zitna 25, blue lecture room, ground floor, rear building

Aronszajn trees are a staple of set theory, but there are applications where the requirement of all levels being countable is of no importance. This is the case in set-theoretic model theory, where trees of height and size ω_{1} but with no uncountable branches play an important role by being clocks of Ehrenfeucht-Fraïssé games that measure similarity of model of size ℵ_{1}. We call such trees wide Aronszajn. In this context one can also compare trees T and T’ by saying that T weakly embeds into T’ if there is a function f that map T into T’ while preserving the strict order <_{T}. This order translates into the comparison of winning strategies for the isomorphism player, where any winning strategy for T’ translates into a winning strategy for T’. Hence it is natural to ask if there is a largest such tree, or as we would say, a universal tree for the class of wood Aronszajn trees with weak embeddings. It was known that there is no such a tree under CH, but in 1994 Mekler and Väänanen conjectured that there would be under MA(ω_{1}).

In our upcoming JSL paper with Saharon Shelah we prove that this is not the case: under MA(ω1) there is no universal wide Aronszajn tree.

The talk will discuss that paper. The paper is available on the arxiv and on line at JSL in the preproof version DOI: 10.1017/jsl.2020.42

In our upcoming JSL paper with Saharon Shelah we prove that this is not the case: under MA(ω1) there is no universal wide Aronszajn tree.

The talk will discuss that paper. The paper is available on the arxiv and on line at JSL in the preproof version DOI: 10.1017/jsl.2020.42