English
Related papers

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

200 papers

We develop an untyped framework for the multiverse of set theory. $\mathsf{ZF}$ is extended with semantically motivated axioms utilizing the new symbols $\mathsf{Uni}(\mathcal{U})$ and $\mathsf{Mod}(\mathcal{U, \sigma})$, expressing that…

Logic · Mathematics 2021-07-01 Paul K. Gorbow , Graham E. Leigh

We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…

Logic · Mathematics 2017-07-25 Andre Kornell

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

We study various classes of maximality principles, $\rm{MP}(\kappa,\Gamma)$, introduced by J.D. Hamkins, where $\Gamma$ defines a class of forcing posets and $\kappa$ is a cardinal. We explore the consistency strength and the relationship…

Logic · Mathematics 2017-04-18 Daisuke Ikegami , Nam Trang

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

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…

Logic · Mathematics 2016-09-06 Sy D. Friedman

We investigate how the sentence choice semantics (SCS) for propositional superposition logic (PLS) developed in \cite{Tz17} could be extended so as to successfully apply to first-order superposition logic(FOLS). There are two options for…

Logic · Mathematics 2023-03-28 Athanassios Tzouvaras

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…

Logic · Mathematics 2025-03-24 Maxwell Levine

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

Logic · Mathematics 2022-12-22 Asaf Karagila , Jonathan Schilhan

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

It is well known that the graph of a total $\mathbf{\Sigma}^1_n$-function is $\mathbf{\Pi}^1_n$. We prove the consistency of the dual assertion at the third projective level: there is a model of $\ZFC$ in which the graph of every total…

Logic · Mathematics 2026-05-21 Stefan Hoffelner

Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…

Logic · Mathematics 2016-09-06 Garvin Melles

We introduce several properties of forcing notions which imply that their lambda-support iterations are lambda-proper. Our methods and techniques refine those studied in math.LO/9906024, math.LO/0210205, math.LO/0508272 and math.LO/0605067,…

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

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

Logic · Mathematics 2018-11-14 James Cummings , Mirna Džamonja , Itay Neeman

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

Logic · Mathematics 2022-05-31 Sandra Müller , Philipp Schlicht

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

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).

Logic · Mathematics 2007-05-23 Saharon Shelah

Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…

Logic · Mathematics 2023-11-08 Robert Goldblatt

We show that there are models of MA where the boldface $\Sigma^1_3$-uniformization property holds. Further we show that BPFA and the assertion $\aleph_1$ is accessible to reals outright implies that the boldface $\Sigma^1_3$-uniformization…

Logic · Mathematics 2025-06-17 Stefan Hoffelner

It is well known that the completeness theorem for $\mathrm{L}_{\omega_1\omega}$ fails with respect to Tarski semantics. Mansfield showed that it holds for $\mathrm{L}_{\infty\infty}$ if one replaces Tarski semantics with boolean valued…

Logic · Mathematics 2023-05-16 Juan M. Santiago , Matteo Viale