Š. Stejskalová

activity

20192024

most citedGuessing models, trees, and cardinal arithmetic

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.LOShow all

7 papers · 1 filter

math.LO2024

Forcing Over a Free Suslin Tree

John Krueger, Šárka Stejskalová

We introduce a forcing for adding almost disjoint automorphisms of a normal infinitely splitting $ω_{1}$ -tree $T$ with countable approximations. Assuming that $T$ is a free Suslin tr…

math.LO2023

Generalized cardinal invariants for an inaccessible $κ$ with compactness at $κ^{++}$

Radek Honzik, Sarka Stejskalova

We show that if the existence of a supercompact cardinal $κ$ with a weakly compact cardinal $λ$ above $κ$ is consistent, then the following are consistent as well (where $\mathfrak…

math.LO2023★ 1 cited

Guessing models, trees, and cardinal arithmetic

Chris Lambie-Hanson, Šárka Stejskalová

Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this p…

math.LO2021

Trees and stationary reflection at double successors of regular cardinals

Thomas Gilton, Maxwell Levine, Šárka Stejskalová

We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $κ$ , updating some classical constructions in the pro…

math.LO2019

Small u(kappa) at singular kappa with compactness at kappa++

Radek Honzik, Sarka Stejskalova

We show that the tree property, stationary reflection and the failure of approachability at $κ^{++}$ are consistent with $u (κ) = κ^{+} < 2^{κ}$ , where $κ$ is a singular stro…

math.LO2019

Easton's theorem for the tree property below aleph_omega

Sarka Stejskalova

Starting with infinitely many supercompact cardinals, we show that the tree property at every cardinal $ℵ_{n}$ , $1 < n < ω$ , is consistent with an arbitrary continuum function be…