Related papers: Forcing with Adequate Sets of Models as Side Condi…

We investigate forcing and independence questions relating to construction schemes. We show that adding $\kappa\geq\omega_1$ Cohen reals adds a capturing construction scheme. We study the weaker structure of $n$-capturing construction…

The effectful forcing technique allows one to show that the denotation of a closed System T term of type $(\iota \to \iota) \to \iota$ in the set-theoretical model is a continuous function $(\mathbb{N} \to \mathbb{N}) \to \mathbb{N}$. For…

In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…

By a virtual model, we mean a model of set theory which is elementary in its transitive closure. Virtual models are first used by Neeman \cite{neeman2014forcing} to iterate forcing. That paper is concerned with proper forcing. The method…

With every $\sigma$-ideal $I$ on a Polish space we associate the $\sigma$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $\sigma$-ideals $I$ and $I^*$ and find connections…

In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…

David Aspero asks on the possibility of having Forcing axiom FA_{aleph_2}(K), where K is the class of forcing notions preserving stationarity of subsets of aleph_1 and of aleph_2. We answer negatively, in fact we show the negative result…

Model semantics for first-order predicate logic is characterized by a visual inference tool called semantic forcing trees for predicate logic. Formulas that are valid (or invalid) by semantic forcing trees match valid (or invalid) formulas…

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…

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…

Electrical machines employing superconductors are attractive solutions in a variety of application domains. Numerical models are powerful and necessary tools to optimize their design and predict their performance. The electromagnetic…

We define the $\aleph_{1.5}$ chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on $\omega_1$ that don't seem to have been considered in the…

We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…

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 present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

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 meager ideal of the…