English
Related papers

Related papers: A variant of Mathias forcing that preserves $\math…

200 papers

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

Logic · Mathematics 2009-09-25 Ralf Schindler

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

Logic · Mathematics 2011-10-18 Bernhard Irrgang

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

We investigate the continuity of the \omega-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that every continuous \omega-function definable by some WFA…

Formal Languages and Automata Theory · Computer Science 2009-08-27 Jarkko Kari , Alexandr Kazda , Paula Steinby

We construct theta liftings from half-integral weight weak Maass forms to even integral weight weak Maass forms by using regularized theta integral. Moreover it gives an extension of Niwa's theta liftings on harmonic weak Maass forms. And…

Number Theory · Mathematics 2011-01-18 YoungJu Choie , Subong Lim

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…

Logic · Mathematics 2007-05-23 Saharon Shelah

We prove that various classical tree forcings -- for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing -- preserve the statement that every real has a sharp and hence analytic determinacy. We then…

Logic · Mathematics 2021-03-19 Fabiana Castiblanco , Philipp Schlicht

We prove that the forcing axiom $MA^{1.5}_{\aleph_2}(\mbox{stratified})$ implies $\Box_{\omega_1, \omega_1}$. Using this implication, we show that the forcing axiom $MM_{\aleph_2}(\aleph_2\mbox{-c.c.})$ is inconsistent. We also derive weak…

Logic · Mathematics 2022-12-15 David Aspero , Nutt Tananimit

A {\it weak selection} on $\mathbb{R}$ is a function $f: [\mathbb{R}]^2 \to \mathbb{R}$ such that $f(\{x,y\}) \in \{x,y\}$ for each $\{x,y\} \in [\mathbb{R}]^2$. In this article, we continue with the study (which was initiated in \cite{ag})…

General Topology · Mathematics 2016-08-23 S. García-Ferreira , A. H. Tomita , Y. F. Ortiz-Castillo

We use coherent systems of FS iterations on a power set, which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component, to prove general theorems about preservation of certain type of unbounded…

Logic · Mathematics 2020-07-07 Diego A. Mejía

We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.

Logic · Mathematics 2025-05-29 Miha E. Habič , Charles Weng , Cathy Zhang

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

Logic · Mathematics 2025-04-16 Gunter Fuchs , Corey Bacal Switzer

Let $A$ and $ B$ be $n\times n$ positive definite complex matrices, let $\sigma$ be a matrix mean, and let $f : [0,\infty)\to [0,\infty)$ be a differentiable convex function with $f(0)=0$. We prove that $$f^{\prime}(0)(A \sigma B)\leq…

Functional Analysis · Mathematics 2024-04-19 Manisha Devi , Jaspal Singh Aujla , Mohsen Kian , Mohammad Sal Moslehian

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

We study cyclic proof systems for $\mu\mathsf{PA}$, an extension of Peano arithmetic by positive inductive definitions that is arithmetically equivalent to the (impredicative) subsystem of second-order arithmetic $\Pi^1_2$-$\mathsf{CA}_0$…

Logic in Computer Science · Computer Science 2025-07-18 Gianluca Curzi , Lukas Melgaard

This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…

Logic · Mathematics 2025-03-04 Sho Shimomichi , Yuto Takeda , Keita Yokoyama

We investigate the statement that the Lebesgue measure defined on all subsets of the Cantor space exists. As base system we take $\mathsf{ACA}_0^\omega + (\mu)$. The system $\mathsf{ACA}_0^\omega$ is the higher order extension of Friedman's…

Logic · Mathematics 2015-04-09 Alexander P. Kreuzer

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.

Logic · Mathematics 2019-02-11 Justin Tatch Moore