Related papers: More about lambda-support iterations of <lambda-co…

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 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…

This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…

The landmark Levy-Solovay Theorem limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that…

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…

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…

Large language models suffer from "hallucinations"-logical inconsistencies induced by semantic noise. We propose that current architectures operate in a "Metric Phase," where causal order is vulnerable to spontaneous symmetry breaking.…

Assuming that $GCH$ holds and $\kappa$ is $\kappa^{+3}$-supercompact, we construct a generic extension $W$ of $V$ in which $\kappa$ remains strongly inaccessible and $(\alpha^+)^{HOD} < \alpha^+$ for every infinite cardinal $\alpha <…

The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

In this paper we provide a general tool to prove the consistency of $I1(\lambda)$ with various combinatorial properties at $\lambda$ typical at settings with $2^\lambda>\lambda^+$, that does not need a profound knowledge of the forcing…

We prove that, consistently, there exists a weakly but not strongly inaccessible cardinal $\lambda$ for which the sequence $\langle 2^\theta:\theta<\lambda\rangle$ is not eventually constant and the weak diamond fails at $\lambda$. We also…

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

This is a continuation of "Some results on nonstationry ideal". The upper bound on precipitousness of NS_lambda^+ for a regular lambda given in this paper is proved to be exact.It is shown that saturatedness of NS_kappa^aleph_0 over…

We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs \Lambda, and prove that C*(\Lambda) is simple if and only if \Lambda is aperiodic and cofinal. The main advantage of our versions of…

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

This article supplements recent work of the authors. (1) A criterion for failure of covariant finiteness of a full subcategory of $\Lambda\text{-mod}$ is given, where $\Lambda$ is a finite dimensional algebra. The criterion is applied to…