Related papers: Forcing Isomorphism II

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…

Let C be a separable unital C*-algebra, not isomorphic to the complex numbers, equipped with a faithful tracial state. Let A be a unital direct limit of one dimensional NCCW complexes, also equipped with a faithful tracial state. Suppose…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

We generically construct a model in which the ${\Pi^1_3}$-uniformization property is true, thus lowering the best known consistency strength from the existence of $M_1^{\#}$ to just $\mathsf{ZFC}$. The forcing construction can be adapted to…

We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

Let G be a group. Two elements x,y are said to be in the same z-class if their centralizers are conjugate in G. Let V be a vector space of dimension n over a field F of characteristic different from 2. Let B be a non-degenerate symmetric,…

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

We prove a strong dichotomy for the number of ultrapowers of a given countable model associated with nonprincipal ultrafilters on N. They are either all isomorphic, or else there are $2^{2^{\aleph_0}}$ many nonisomorphic ultrapowers. We…

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

We characterize the group property of being with infinite conjugacy classes (or icc, i.e. \not= 1 and of which all conjugacy classes except 1 are infinite) for finite extensions of group.

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

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…

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

Based on the monoid classifier, we give an alternative axiomatization of Freyd's paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and…

There are two ways to turn a categorical model for pure quantum theory into one for mixed quantum theory, both resulting in a category of completely positive maps. One has quantum systems as objects, whereas the other also allows classical…