English
Related papers

Related papers: The modal logic of $\sigma$-centered forcing and r…

200 papers

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…

Logic · Mathematics 2024-08-22 Manuel Sierra Aristizábal

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

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

In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…

Logic · Mathematics 2024-11-19 Ben De Bondt , Alessandro Vignati

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…

Logic · Mathematics 2016-09-07 Saharon Shelah

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…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

We prove that it is consistent that every two disjoint boldface $\mathbf{\Sigma}^1_1$ subsets of $\omega_1^{\omega_1}$ can be separated by a boldface $\mathbf{\Delta}^1_1$ set. The forcing starts from $L$ and preserves CH and therefore also…

Logic · Mathematics 2026-05-21 Stefan Hoffelner

We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.

Logic · Mathematics 2018-01-16 Saharon Shelah

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.

Logic · Mathematics 2009-09-25 Andrzej Rosłanowski , Saharon Shelah

In this paper we introduce a modal theory $H_{\sigma}$, which is sound and complete for arithmetical $\Sigma$_1 substitutions in ${\bf HA}$, in other words, we will show that $H_{\sigma}$ is the $\Sigma$_1-provability logic of ${\bf HA}$.…

Logic · Mathematics 2017-11-03 Mohammad Ardeshir , S. Mojtaba Mojtahedi

In this paper we isolate the notion of Stratified class forcing and show that Stratification implies cofinality-preservation and is preserved by iterations with the appropriate support. Many familiar class forcings are stratified and…

Logic · Mathematics 2008-02-03 Sy D. Friedman

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

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

A transitive model $M$ of ZFC is called a ground if the universe $V$ is a set forcing extension of $M$. We show that the grounds of $V$ are downward set-directed. Consequently, we establish some fundamental theorems on the forcing method…

Logic · Mathematics 2018-07-23 Toshimichi Usuba

We introduce a hierarchy of models of the Axiom of Determinacy called \emph{Nairian models}. Forcing over the simplest Nairian model, we obtain a model of ${\sf{ZFC}}+{\sf{MM^{++}}}(c)+\neg\square_{\omega_3}+\neg\square(\omega_3)$. Then,…

Logic · Mathematics 2025-02-03 Douglas Blue , Paul B. Larson , Grigor Sargsyan

Whenever I is a projectively generated projectively defined sigma ideal on the reals, if ZFC+large cardinals proves cov(I)=continuum then ZFC+large cardinals proves non(I)<aleph four.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

We study the existence of finite characterisations for modal formulas. A finite characterisation of a modal formula $\varphi$ is a finite collection of positive and negative examples that distinguishes $\varphi$ from every other,…

Logic in Computer Science · Computer Science 2024-02-13 Balder ten Cate , Raoul Koudijs

A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…

Logic · Mathematics 2021-07-01 Ashutosh Kumar , Dilip Raghavan

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

Logic · Mathematics 2023-06-22 Gunter Fuchs