Related papers: Coherent Adequate Forcing and Preserving CH

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…

The paper deals with a class of cooperative functional differential equations (FDEs) with infinite delay, for which sufficient conditions for persistence and permanence are established. Here, the persistence refers to all solutions with…

We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real numbers, typically associated with some…

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…

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…

We prove the consistency of the theory ZFC + there is a strongly compact cardinal from the existence of a cardinal preserving embedding from the universe into an inner model. The proof almost shows that under SCH, every cardinal preserving…

We show that some of the most prominent large cardinal notions can be characterized through the validity of certain combinatorial principles at $\omega_2$ in forcing extensions by the pure side condition forcing introduced by Neeman. The…

We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…

Suppose $\kappa$ is $\lambda$-supercompact witnessed by an elementary embedding $j:V\rightarrow M$ with critical point $\kappa$, and further suppose that $F$ is a function from the class of regular cardinals to the class of cardinals…

The {\em Singular Cardinal Hypothesis} (SCH) is one of the most classical combinatorial principles in set theory. It says that if $\kappa$ is singular strong limit, then $2^{\kappa}=\kappa^+$. We prove that given a singular cardinal…

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…

Chang's Conjecture (CC) asserts that for every $F:[\omega_2]^{<\omega} \to \omega_2$, there exists an $X$ that is closed under $F$ such that $|X|=\omega_1$ and $|X \cap \omega_1| =\omega$. By classic results of Silver and Donder, CC is…

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.

We consider a class of singular ordinary differential equations describing analytic systems of arbitrary finite dimension, subject to a quasi-periodic forcing term and in the presence of dissipation. We study the existence of response…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

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…