相关论文: Revised support iterations and CH

We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

We present a universal framework for similarity-preserving encodings that subsumes all discrete, continuous, algebraic, and learned similarity methods under a single theoretical umbrella. By formulating similarity as functional witness…

Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…

In this paper, we study necessary and sufficient conditions for the existence of categorical universal coverings using open covers of a given space $X$. As some applications, first we present a generalized version of the Shelah Theorem…

An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, called schematic CERES, can be used to analyze these proofs,…

Elementary transformations of equations $A\psi=\lambda\psi$ are considered. The invertibility condition (Theorem 1) is established and similar transformations of Riccati equations in the case of second order differential operator $A$ are…

Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…

For any $2 \le n < \omega$, we introduce a forcing poset using generalized promises which adds a normal $n$-splitting subtree to a $(\ge \! n)$-splitting normal Aronszajn tree. Using this forcing poset, we prove several consistency results…

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

The cut-elimination procedure for the provability logic is known to be problematic: a L\"ob-like rule keeps cut-formulae intact on reduction, even in the principal case, thereby complicating the proof of termination. In this paper, we…

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_\theta,\mathfrak{p}_\theta,\mathfrak{g}_\theta,\mathfrak{r}_\theta,\mathfrak{t}_\theta$ at uncountable regular…

Suppose $\kappa$ is a singular strong limit cardinal of countable cofinality and let $\langle \kappa_{n}: n<\omega \rangle$ be an incrasing sequence of regular cardinals cofinal in $\kappa$. We show that if $cf(2^\kappa)= \kappa^+$, then…