6 papers · 1 filter
Iterating Generalised Perfect Set Forcing Along Well-Founded Orders
Mirna Džamonja
The technique of geometric forcing iteration was developed by Kanovei \cite{zbMATH01335192} and used to prove that the perfect set forcing can be iterated with countable supports a…
A note on iterating strongly -closed stationary -cc forcing
Mirna Džamonja
We give an exposition of an iteration theorem for iterating -closed stationary -cc forcing with supports of size and preserving these two properties. We discuss…
Property B: A Baumgartner-style Property that Applies to Preservation of and under Iterations with Supports of Size
Mirna Džamonja
We prove a theorem on iterated forcing that can be used for preservation of and in iterations with supports of size of forcings that have amalgamat…
MSO logic of the real order with the set quantifiers ranging over the Borel sets
Mirna Džamonja
A celebrated 1969 theorem of Michael Rabin is that the MSO theory of the real order where the monadic quantifier is allowed only to range over the sets of rational numbers, is deci…
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Mirna Džamonja, Sylvain Schmitz, Philippe Schnoebelen
We investigate the ordinal invariants height, length, and width of well quasi orders (WQO), with particular emphasis on width, an invariant of interest for the larger class of orde…
On maximal order type of the lexicographic product
Mirna Džamonja, Isa Vialard
In the previously submitted version of this paper, available here for the record, we stated the following : "We give a self-contained proof of Isa Vialard's formula for $o(P\cdot Q…