Related papers: Forcing and Construction Schemes
We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding…
The resource theory of quantum superposition is an extension of the quantum coherent theory, in which linear independence relaxes the requirement of orthogonality. It can be used to quantify the nonclassical in superposition of finite…
We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].
The aim of this paper is to extend Cohen structure theorem beyond local rings. Both Cohen structure theorem and Nagata's generalization of it are special cases of our results. We investigate for which rings $R$ there exists a maximal ideal…
The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…
The essentially non-free spectrum is the class of uncountable cardinals kappa in which there is an essentially non-free algebra of cardinality kappa which is almost free. In L, the essentially non-free spectrum of a variety is entirely…
Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…
Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…
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…
We give a survey of cardinal charcteristics of the higher Cicho\'n diagram defined on the higher Baire space ${}^\kappa\kappa$ for $\kappa$ regular with $2^{<\kappa}=\kappa$. Specifically, we will compare consistency proofs from the…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…
This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…
We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…
We introduce a new and natural stationary set preserving forcing $\mathbb P^{c-c}({\lambda},{\mu})$ that (under $\mathsf{NS}_{\omega_1}$ precipitous + existence of $H_{\theta}^#$ for a sufficiently large regular ${\theta}$) increases the…
We give a fully constructive proof that there is a proper cartesian $\omega$-combinatorial model structure on the category of simplicial sets, whose generating cofibrations and trivial cofibrations are the usual boundary inclusion and horn…
The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
We study model theoretic characterizations of various collection schemes over $\mathbf{PA}^-$ from the viewpoint of Gaifman's splitting theorem. Among other things, we prove that for any $n \geq 0$ and $M \models \mathbf{PA}^-$, the…