English
Related papers

Related papers: A note on the Revised GCH

200 papers

Let R be a subring of Q and recall from math.LO/9910161 that an R-module G is a splitter if Ext_R(G,G)=0. We correct the statement of Main Theorem 1.5 in math.LO/9910161. Assuming CH any aleph_1$-free splitter of cardinality aleph_1 is free…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the…

Logic · Mathematics 2025-06-12 Ang Li

We obtain a small ultrafilter number at $\aleph_{\omega_1}$. Moreover, we develop a version of the overlapping strong extender forcing with collapses which can keep the top cardinal $\kappa$ inaccessible. We apply this forcing to construct…

Logic · Mathematics 2025-12-10 Tom Benhamou , Sittinon Jirattikansakul

We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher order arithmetic. Let U be the statement that a non-principal ultrafilter exists and let ACA_0^{\omega} be the higher order extension of…

Logic · Mathematics 2013-03-01 Alexander P. Kreuzer

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber

Assume ZF($j$) and there is a Reinhardt cardinal, as witnessed by the elementary embedding $j:V\to V$. We investigate the linear iterates $(N_{\alpha},j_{\alpha})$ of $(V,j)$, and their relationship to $(V,j)$, forcing and definability,…

Logic · Mathematics 2020-06-30 Farmer Schlutzenberg

Cicho\'n's diagram describes the connections between combinatorial notions related to measure, category, and compactness of sets of irrational numbers. In the second part of the 2010's, Goldstern, Kellner and Shelah constructed a forcing…

Logic · Mathematics 2026-04-01 Diego A. Mejía

We give a necessary and sufficient condition for an atomless Boolean algebra to be countably generated, and use it to give new proofs of some some know facts due to Gaifman-Hales and Solovay and also due to Jech, Kunen and Magidor. We also…

Logic · Mathematics 2016-11-10 Mohammad Golshani

We extend and improve the result of Makkai and Par\'e that the powerful image of any accessible functor F is accessible, assuming there exists a sufficiently large strongly compact cardinal. We reduce the required large cardinal assumption…

Category Theory · Mathematics 2016-03-23 Andrew Brooke-Taylor , Jiří Rosický

We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…

Logic · Mathematics 2022-03-15 Saharon Shelah

We work in the setting of Zermelo-Fraenkel set theory without assuming the Axiom of Choice. We consider sets with the Boolean operations together with the additional structure of comparing cardinality (in the Cantorian sense of injections).…

Logic · Mathematics 2025-01-16 Matthew Harrison-Trainor , Dhruv Kulshreshtha

In the first part of this paper, we explore the possibility for a very large cardinal $\kappa$ to carry a $\kappa$-complete ultrafilter without Galvin's property. In this context, we prove the consistency of every ground model…

Logic · Mathematics 2025-11-07 Tom Benhamou , Shimon Garti , Alejandro Poveda

This paper explores several topics related to Woodin's HOD conjecture. We improve the large cardinal hypothesis of Woodin's HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a…

Logic · Mathematics 2021-07-02 Gabriel Goldberg

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

We show that if a field A is not pseudo-finite, then there is no prime model of the theory of pseudo-finite fields over A. Assuming GCH, we generalise this result to \kappa-prime models, for \kappa a regular uncountable cardinal or…

Logic · Mathematics 2025-08-06 Zoé Chatzidakis

We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…

Logic · Mathematics 2008-02-03 Michael C. Laskowski , Saharon Shelah

We introduce the notion of a w-good $\lambda$-frame which is a weakening of Shelah's notion of a good $\lambda$-frame. Existence of a w-good $\lambda$-frame implies existence of a model of size $\lambda^{++}$. Tameness and amalgamation…

Logic · Mathematics 2018-03-13 Marcos Mazari Armida

A cardinal is weakly Reinhardt if it is the critical point of an elementary embedding from the universe of sets into a model that contains the double powerset of every ordinal. This note establishes the equiconsistency of a proper class of…

Logic · Mathematics 2021-07-29 Gabriel Goldberg

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

Logic · Mathematics 2024-09-02 Noah Schweber

In accordance with P. Vogel, a set of algebra structures in Chern-Simons theory can be made universal, independent of a particular family of simple Lie algebras. In particular, this means that various quantities in the adjoint…

High Energy Physics - Theory · Physics 2025-05-23 Liudmila Bishler , Andrei Mironov
‹ Prev 1 4 5 6 7 8 10 Next ›