English
Related papers

Related papers: Force a set model of $Z_3$ + Harrington's Principl…

200 papers

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

Logic · Mathematics 2025-06-10 Slavica Mihaljevic Vlahovic , Branislav Dobrasin Vlahovic

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open…

Logic · Mathematics 2025-06-16 Calliope Ryan-Smith

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 address the question regarding the structure of the Mitchell order on normal measures. We show that every well founded order can be realized as the Mitchell order on a measurable cardinal $\kappa$ from some large cardinal assumption.

Logic · Mathematics 2015-08-18 Omer Ben-Neria

Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…

Logic · Mathematics 2022-06-24 Alec Rhea

We introduce a new and natural stationary set preserving forcing $\mathbb P^{c-c}({\lambda},{\mu})$ that (under $\mathsf{NS}_{\omega_1}$ precipitous + existence of $H_{\theta}^#$ for a sufficiently large regular ${\theta}$) increases the…

Logic · Mathematics 2024-02-13 Ben De Bondt , Boban Velickovic

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

Logic · Mathematics 2015-03-30 Mohammad Golshani

This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries.…

Logic · Mathematics 2023-06-21 Bokai Yao

We solve the satisfiability problem for a three-sorted fragment of set theory (denoted $3LQST_0^R$), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator $\{\text{-},…

Logic in Computer Science · Computer Science 2015-06-05 Domenico Cantone , Marianna Nicolosi-Asmundo

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 show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…

Logic · Mathematics 2022-08-02 Jonathan Schilhan

This paper reports a modified axiomatic foundation of the analytic hierarchy process (AHP), where the reciprocal property of paired comparisons is broken. The novel concept of reciprocal symmetry breaking is proposed to characterize the…

Information Theory · Computer Science 2021-08-05 Fang Liu , Wei-Guo Zhang

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

Logic · Mathematics 2010-12-10 Christoph Weiß

For $n<\omega$, we say that the $\Pi^1_n$-reflection principle holds at $\kappa$ and write $\text{Refl}_n(\kappa)$ if and only if $\kappa$ is a $\Pi^1_n$-indescribable cardinal and every $\Pi^1_n$-indescribable subset of $\kappa$ has a…

Logic · Mathematics 2021-04-29 Brent Cody

We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Number Theory · Mathematics 2020-06-30 Komal Agrawal , Paul Pollack

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

Functional Analysis · Mathematics 2019-10-03 Colin C. Graham

Starting from an inaccessible cardinal, we construct a model of $ZF+DC$ where there exists a mad family and all sets of reals are $\mathbb Q$-measurable for $\omega^{\omega}$-bounding sufficiently absolute forcing notions $\mathbb Q$.

Logic · Mathematics 2017-05-17 Haim Horowitz , Saharon Shelah

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

Logic · Mathematics 2016-09-07 Saharon Shelah