Related papers: Forcing Isomorphism II
In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…
A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…
The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…
We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We generalize the main result of arXiv:2505.17960 and show the consistency of the statement ``There are exactly $n$ $Q$-points up to isomorphism" for any finite $n$. Furthermore, we show that the above statement for $n=2$ can alternatively…
We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…
We introduce two related notions of pattern enforcement in $(0,1)$-matrices: $Q$-forcing and strongly $Q$-forcing, which formalize distinct ways a fixed pattern $Q$ must appear within a larger matrix. A matrix is $Q$-forcing if every…
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…
Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.
I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.
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…
We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application…
Given a Fra\"{i}ss\'{e} class $\mathcal{K}$ and an infinite cardinal $\kappa,$ we define a forcing notion which adds a structure of size $\kappa$ using elements of $\mathcal{K}$, which extends the Fra\"{i}ss\'{e} construction in the case…
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
The Necessary Maximality Principle for c.c.c. forcing asserts that any statement about a real in a c.c.c. extension that could become true in a further c.c.c. extension and remain true in all subsequent c.c.c. extensions, is already true in…
We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [lambda, 2^lambda]. This generalizes results of [276], Section…