English
Related papers

Related papers: A simple maximality principle

200 papers

We present a new version of the Friedman-Magidor theorem: for every measurable cardinal $\kappa$ and $\tau\leq\kappa^{++}$, there exists a forcing extension $V\subseteq V[G]$ such that any normal measure $U\in V$ on $\kappa$ has exactly…

Logic · Mathematics 2025-09-11 Eyal Kaplan

We give necessary and sufficient conditions for the group of a rational maximal bifix code $Z$ to be isomorphic with the $F$-group of $Z\cap F$, when $F$ is recurrent and $Z\cap F$ is rational. The case where $F$ is uniformly recurrent,…

Group Theory · Mathematics 2023-05-18 Jorge Almeida , Alfredo Costa , Revekka Kyriakoglou , Dominique Perrin

In this article, we generalize a previously defined set of axioms for a closure operation that induces balanced big Cohen-Macaulay modules. While the original axioms were only defined in terms of finitely generated modules, these new ones…

Commutative Algebra · Mathematics 2018-02-01 Geoffrey D. Dietz

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

We introduce two related notions of pattern enforcement in $(0,1)$-matrices: $Q$-forcing and strongly $Q$-forcing, which formalize distinct ways a fixed pattern $Q$ must appear within a larger matrix. A matrix is $Q$-forcing if every…

Combinatorics · Mathematics 2025-11-03 Lei Cao , Shen-Fu Tsai

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Logic · Mathematics 2020-03-23 Matteo Viale

This note addresses the continuum problem, taking advantage of the breakthrough mentioned in the subtitle, and relating it to many recent advances occurring in set theory.

Logic · Mathematics 2023-05-18 Matteo Viale

G\"odel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum…

Logic · Mathematics 2024-12-13 Sandra Müller , Grigor Sargsyan

Set-theoretic axioms formulated in terms of existence of a Laver-generic large cardinal were introduced in [16] and studied further in [17], [18], [20]. These axioms, let us call them Laver-genericity axioms, claim the existence of a…

Logic · Mathematics 2023-09-12 Sakaé Fuchino

The necessity of a Maximum Principle arises naturally when one is interested in the study of qualitative properties of solutions to partial differential equations. In general, to ensure the validity of these kind of principles one has to…

Analysis of PDEs · Mathematics 2023-10-04 Andrea Bisterzo

In this paper we prove a strong maximum principle for certain parabolic systems of equations. In particular, our methods place no restriction on the regularity of the boundary of the convex set in which the system takes its values, and…

Analysis of PDEs · Mathematics 2010-08-23 Lawrence Christopher Evans

We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the existence of large families of objects that are in some sense…

Logic · Mathematics 2026-02-04 David Belanger , Chi Tat Chong , Rupert Hölzl , Frank Stephan

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

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

We force the Axiom of Choice over the least initial segment of a Nairian model satisfying ZF. In the forcing extension, square_kappa fails at all uncountable cardinals kappa, and every regular cardinal is omega-strongly measurable in HOD,…

Logic · Mathematics 2026-02-16 Douglas Blue , Paul Larson , Grigor Sargsyan

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

Logic · Mathematics 2021-12-21 Sittinon Jirattikansakul

Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…

Logic · Mathematics 2023-03-03 Chris Lambie-Hanson , Šárka Stejskalová

In the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…

Logic · Mathematics 2016-09-20 Nam Trang , Trevor Wilson

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

Usuba has asked whether the $\kappa$-mantle, the intersection of all grounds that extend to $V$ via a forcing of size ${<}\kappa$, is always a model of ZFC. We give a negative answers by constructing counterexamples where $\kappa$ is a…

Logic · Mathematics 2024-03-15 Andreas Lietz