English
Related papers

Related papers: Subcomplete forcing principles and definable well-…

200 papers

We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

Logic · Mathematics 2011-02-14 David Aspero , Sy-David Friedman , Miguel Angel Mota , Marcin Sabok

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Logic · Mathematics 2019-03-08 Philip Welch

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Theoretical Economics · Economics 2021-11-17 Leandro Gorno , Alessandro Rivello

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

Logic · Mathematics 2022-02-25 Jeffrey Bergfalk , Vera Fischer , Corey Bacal Switzer

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…

Logic · Mathematics 2015-07-30 Matteo Viale

A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…

Logic · Mathematics 2007-05-23 Jonas Reitz

Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…

Logic · Mathematics 2009-09-25 Renling Jin , Saharon Shelah

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…

Logic · Mathematics 2007-05-23 Joel David Hamkins , W. Hugh Woodin

Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…

Logic · Mathematics 2025-10-02 Yong Cheng

A subset $A$ of a vector space $X$ is called $\alpha$-lineable whenever $A$ contains, except for the null vector, a subspace of dimension $\alpha$. If $X$ has a topology, then $A$ is $\alpha$-spaceable if such subspace can be chosen to be…

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

This article makes no claim to originality, other than, perhaps, the simple statement here called the {\it Abstract Maximum Principle}. Actually, the whole contents are strongly based on some H. Sussmann's and coauthors' papers, in which,…

Optimization and Control · Mathematics 2023-10-17 Monica Motta , Franco Rampazzo

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

Logic · Mathematics 2023-01-03 Mohammad Golshani , Haim Horowitz , Saharon Shelah

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

Logic · Mathematics 2025-08-26 David Asperó , Mohammad Golshani

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

Logic · Mathematics 2025-03-07 Francesco Parente , Matteo Viale

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…

Logic · Mathematics 2020-04-21 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…

In this paper, we consider the following non-linear equations in unbounded domains $\Omega$ with exterior Dirichlet condition: \begin{equation*}\begin{cases} (-\Delta)_p^s u(x)=f(u(x)), & x\in\Omega,\\ u(x)>0, &x\in\Omega,\\ u(x)\leq0,…

Analysis of PDEs · Mathematics 2019-05-17 Zhao Liu , Wenxiong Chen