English
Related papers

Related papers: Incompatible category forcing axioms

200 papers

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

This paper is concerned with a class K of models and an abstract notion of submodel <=. Experience in first order model theory has shown the desirability of finding a `monster model' to serve as a universal domain for K. In the original…

Logic · Mathematics 2009-09-25 John T. Baldwin , Saharon Shelah

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

Logic · Mathematics 2023-06-13 Tamás Csernák , Lajos Soukup

We show that under $\BMM$ and "there exists a Woodin cardinal$"$, the nonstationary ideal on $\omega_1$ can not be defined by a $\Sigma_1$ formula with parameter $A \subset \omega_1$. We show that the same conclusion holds under the…

Logic · Mathematics 2025-06-17 Stefan Hoffelner , Paul Larson , Ralf Schindler , Liuzhen Wu

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…

Logic · Mathematics 2025-04-16 Sandra Müller , Grigor Sargsyan

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

Logic · Mathematics 2015-01-26 David Asperó , Miguel Angel Mota

We prove that a universal class categorical in a high-enough cardinal is categorical on a tail of cardinals. As opposed to other results in the literature, we work in ZFC, do not require the categoricity cardinal to be a successor, do not…

Logic · Mathematics 2017-03-28 Sebastien Vasey

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

Here we show that, given a finite homological system $({\cal P},\leq,\{\Delta_u\}_{u\in {\cal P}})$ for a finite-dimensional algebra $\Lambda$ over an algebraically closed field, the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules…

Representation Theory · Mathematics 2026-02-09 Raymundo Bautista Ramos , Jesús Efrén Pérez Terrazas , Leonardo Salmerón Castro

In this paper, we address the question of when a non-free $\aleph_1$-free group $H$ can be be free in a transitive cardinality-preserving model extension. Using the $\Gamma$-invariant, denoted $\Gamma(H)$, we present a necessary and…

Group Theory · Mathematics 2022-01-19 Daniel Bossaller , Daniel Herden , Alexandra V. Pasi

We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…

Logic · Mathematics 2009-09-25 Jörg Brendle

In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

We define the notion of a $\lambda$-definable category, a generalisation of the notion of definable category from the model theory of modules. Let ${\cal C}$ be a $\lambda$-accessible additive category. We characterise the additive functors…

Representation Theory · Mathematics 2025-01-08 Samuel Dean

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…

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

According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal $\lambda$ and non-trivial elementary embedding $j:V_{\lambda+2}\to V_{\lambda+2}$. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone has been…

Logic · Mathematics 2024-03-19 Farmer Schlutzenberg

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais

We analyze causality and unitarity constraints in graviton scattering amplitudes, aiming to establish new bounds on theories with $U(1)$-gravitational anomalies, such as axion models or strongly-coupled gauge theories. For this purpose, we…

High Energy Physics - Theory · Physics 2025-01-15 Zi-Yu Dong , Teng Ma , Alex Pomarol , Francesco Sciotti

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
‹ Prev 1 4 5 6 7 8 10 Next ›