I isolate a combinatorial property of a poset $\mathbb{P}$ that I call the strong Prikry property, which implies the existence of an ultrafilter on the complete Boolean algebra $\mathbb{B}$ of $\mathbb{P}$ such that one inclusion of the Boolean ultrapower version of the so-called \Bukovsky-Dehornoy phenomenon holds with respect to $\mathbb{B}$ and $U$. I show that in all cases that were previously studied, and for which it was shown that they come with a canonical iterated ultrapower construction whose limit can be described as a single Boolean ultrapower, the posets in question satisfy this property: Prikry forcing, Magidor forcing and generalized Prikry forcing.
We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias--Prikry forcings with summable ideals are all mutually bi-embeddable. We show that Mathias forcing associated with the complement of an analytic ideal always adds a dominating real. We also characterize filters for which the associated Mathias--Prikry forcing does not add eventually different reals, and show that they are countably generated provided they are Borel. We give a characterization of $ω$-hitting and $ω$-s…
We introduce a class of notions of forcing which we call $Σ$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $Σ$-Prikry. We show that given a $Σ$-Prikry poset $\mathbb P$ and a name for a non-reflecting stationary set $T$, there exists a corresponding $Σ$-Prikry poset that projects to $\mathbb P$ and kills the stationarity of $T$. Then, in a sequel to this paper, we develop an iteration scheme for $Σ$-Prikry posets. Putting the two works together, we obtain a proof of the following. Theorem. If $κ$ is the…
Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_κ$ consisting of perfect trees of height $λ$ and width $κ$ where $κ$ is a singular $ω$-strong limit of cofinality $λ$. They showed that if $κ$ is singular of countable cofinality, then $\mathbb{P}_κ$ is minimal for $ω$-sequences assuming that $κ$ is a supremum of a sequence of measurable cardinals. We obtain this result without the measurability assumption. Prikry proved that $\mathbb{P}_κ$ is $(ω,ν)$-distributive for all $ν<κ$ given a singular $ω$-strong limit cardinal $κ$ of countable cofinality, and Dobrinen et al$.$ asked whether …
We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals $\langle κ_n: n< ω\rangle$, Prikry defined the forcing $\mathbb{P}$ all perfect subtrees of $\prod_{n<ω}κ_n$, and proved that for $κ=\sup_{n<ω}κ_n$, assuming the necessary cardinal arithmetic, the Boolean completion $\mathbb{B}$ of $\mathbb{P}$ is $(ω,μ)$-distributive for all $μ<κ$ but $(ω,κ,δ)$-distributivity fails for all $δ<κ$, implying failure of the $(ω,κ)$-d.l. …
In the first part of the paper, we show that if $ω\le κ< λ$ are cardinals, $κ^{<κ} = κ$, and $λ$ is weakly compact, then in $V[\M(κ,λ)]$ the tree property at $λ= κ^{++V[\M(κ,λ)]}$ is indestructible under all $κ^+$-cc forcing notions which live in $V[\Add(κ,λ)]$, where $\Add(κ,λ)$ is the Cohen forcing for adding $λ$-many subsets of $κ$ and $\M(κ,λ)$ is the standard Mitchell forcing for obtaining the tree property at $λ= (κ^{++})^{V[\M(κ,λ)]}$. This result has direct applications to Prikry-type forcing notions and generalized cardinal invariants. In the second part, we assume that $λ$ is superco…
Einstein Institute of Mathematics, The Hebrew University of Jerusalem（希伯来大学爱因斯坦数学研究所）；Department of Mathematics, Rutgers University（罗格斯大学数学系）
We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce that countable free homogeneous structures in a locally finite relational language have the strong small index property. We also exhibit new continuum sized classes of $\aleph_0$-categorical structures with the strong small index property whose automorphism groups are pairwise non-isomorphic.
In this paper we review Shelah's strong covering property and its applications. We also extend some of the results of Shelah and Woodin on the failure of $CH$ by adding a real.
We show that there is a boolean algebra that has the Freese-Nation property (FN) but not the strong Freese-Nation property (SFN), thus answering a question of Heindorf and Shapiro. Along the way, we produce some new characterizations of the FN and SFN in terms of sequences of elementary submodels.
We show that it is consistent, relative to $ω$ many supercompact cardinals, that the super tree property holds at $\aleph_n$ for all $2 \leq n < ω$ but there are weak square and a very good scale at $\aleph_ω$.
In \cite{HPP}, Hrushovski and the authors proved, in a certain finite rank environment, that rigidity of definable Galois groups implies that $T$ has the canonical base property in a strong form, " internality to" being replaced by "algebraicity in". In the current paper we give a reasonably robust definition of the "strong canonical base property" in a rather more general finite rank context than \cite{HPP}, and prove its {\em equivalence} with rigidity of the relevant definable Galois groups. The new direction is an elaboration on the old result that $1$-based groups are rigid.
Assuming the existence of a strong cardinal $κ$ and a measurable cardinal above it, we force a generic extension in which $κ$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds at $κ^{++}$.
We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.
Einstein Institute of Mathematics, The Hebrew University of Jerusalem（爱因斯坦数学研究所，耶路撒冷希伯来大学）；Department of Mathematics, Rutgers University（罗格斯大学数学系）
Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For homogeneous $M \in \mathbf{K}$, we introduce what we call the expanded group of automorphisms of $M$, and show that it is second-order definable in $Aut(M)$. We use this to prove that for $M, N \in \mathbf{K}_*$, $Aut(M)$ and $Aut(N)$ are isomorphic as abstract groups if and only if $(Aut(M), M)$ and $(Aut(N), N)$ are isomorphic as permutation groups. In pa…
Assuming the existence of a strong cardinal and a measurable cardinal above it, we construct a model of $ZFC$ in which for every singular cardinal $δ$, $δ$ is strong limit, $2^δ=δ^{+3}$ and the tree property at $δ^{++}$ holds. This answers a question of Friedman, Honzik and Stejskalova [8]. We also produce, relative to the existence of a strong cardinal and two measurable cardinals above it, a model of $ZFC$ in which the tree property holds at all regular even cardinals. The result answers questions of Friedman-Halilovic [5] and Friedman-Honzik [6].
We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem.
