Related papers: The subcompleteness of diagonal Prikry forcing
Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…
We develop the non-normal variations of two classical Prikry-type forcings; namely, Magidor and Radin forcings. We generalize the fact that the non-normal Prikry forcing is a projection of the extender-based to a coordinate of the extender…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a…
It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…
In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…
We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…
Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…
Harary et al. and Klein and Randic proposed the forcing number of a perfect matching in mathematics and chemistry, respectively. In detail, the forcing number of a perfect matching M of a graph G is the smallest cardinality of subsets of M…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…
The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping…
We study the possible number of normal measures on a measurable cardinal in settings where inner model techniques are unavailable. Instead, we exploit consequences of the Ultrapower Axiom to obtain our theorems. We show that the classical…
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…
This paper is meant to present in a coherent way several instances of quite common phenomena that was first identified (independently) by Bukovsk\'y and Dehornoy. We present the basic result for Prikry type forcing and show how to extend it…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…
We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…
The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…
We study the generalized dominating number $\mathfrak{d}_{\mu}$ at a singular cardinal $\mu$ of cofinality $\kappa$. We show two lower bounds: in ZFC, $\mathrm{cf}([\mu]^\kappa,\subseteq) \leq \mathfrak{d}_{\mu}$, and under mild…