English
Related papers

Related papers: Sufficient conditions for the forcing theorem, and…

200 papers

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

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

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Logic · Mathematics 2008-02-03 Saharon Shelah

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

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

Logic · Mathematics 2007-05-23 Itay Neeman , Jindrich Zapletal

We derive sufficient conditions for theories consisting of multiple vector fields, which could also couple to external fields, to be multi-field generalised Proca theories. The conditions are derived by demanding that the theories have the…

High Energy Physics - Theory · Physics 2024-01-09 Sujiphat Janaun , Pichet Vanichchapongjaroen

In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…

Logic · Mathematics 2025-10-02 Mohsen Asgharzadeh , Mohammad Golshani , Saharon Shelah

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…

Logic · Mathematics 2015-10-15 Carolin Antos , Sy-David Friedman

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Benedikt Loewe

With infinitely many high-quality data points, infinite computational power, an infinitely large foundation model with a perfect training algorithm and guaranteed zero generalization error on the pretext task, can the model be used for…

Artificial Intelligence · Computer Science 2026-04-27 Yang Yuan

Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…

Logic · Mathematics 2018-05-23 David Aspero , Matteo Viale

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well…

Combinatorics · Mathematics 2017-06-07 Jan Hubička , Jaroslav Nešetřil

A common technique for producing a new model category structure is to lift the fibrations and weak equivalences of an existing model structure along a right adjoint. Formally dual but technically much harder is to lift the cofibrations and…

Algebraic Topology · Mathematics 2022-05-23 Kathryn Hess , Magdalena Kedziorek , Emily Riehl , Brooke Shipley

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…

Logic · Mathematics 2020-01-07 Toshimichi Usuba

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

In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

Given an ordered field $\mathbb{T}$ of formal series over an ordered field $\mathbf{R}$ equipped with a composition law $\circ \colon \mathbb{T} \times \mathbb{T}^{>\mathbb{R}} \longrightarrow \mathbb{T}$, we give conditions for…

Logic · Mathematics 2025-09-12 Vincent Bagayoko
‹ Prev 1 3 4 5 6 7 10 Next ›