Related papers: Forcing Square_{omega_1} with finite conditions
We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…
We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…
We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…
We prove the validity of maximum principles for a class of fully nonlinear operators on unbounded subdomains $\Omega \subset \mathbb R^n$ of cylindrical type. The main structural assumption is the uniform ellipticity of the operator along…
We establish the existence of positive solutions for a system of coupled fourth-order partial differential equations on a bounded domain $\Omega \subset \mathbb{R}^n$\begin{align*} \left\{\begin{array}{l} \Delta^2u_1 +\beta_1 \Delta…
We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…
Starting from infinitely many supercompact cardinals, we force a model of ZFC where $\aleph_{\omega^2+1}$ satisfies simultaneously a strong principle of reflection, called $\Delta$-reflection, and a version of the square principle, denoted…
In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [JR1] in which several problems were posed. We answer some of those problems here.
The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.
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 introduce a property of posets which strengthens (\omega_1+1)-strategic closedness. This property is defined using a variation of the Banach-Mazur game on posets, where the first player chooses a countable set of conditions instead of a…
In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an…
We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…
In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…
We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…
We apply a general approach for distributions of binary isolating and semi-isolating formulas to the class of strongly minimal theories.
We consider the forced problem $-\Delta_p u - V(x)|u|^{p-2} u = f(x)$, where $\Delta_p$ is the $p$-Laplacian ($1<p<\infty$) in a domain $\Omega\subset \mathbb{R}^N$, $V\ge 0$ and $Q_V (u) := \int_\Omega |\nabla u|^p\, dx - \int_\Omega…
This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.