English
Related papers

Related papers: Inaccessibility and Subinaccessibility. In two par…

200 papers

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

General Mathematics · Mathematics 2010-02-25 J. A. Perez

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

Logic · Mathematics 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

We unveil new patterns of Structural Reflection in the large-cardinal hierarchy below the first measurable cardinal. Namely, we give two different characterizations of strongly unfoldable and subtle cardinals in terms of a weak form of the…

Logic · Mathematics 2023-11-07 Joan Bagaria , Philipp Lücke

The purpose of this paper is to provide an introductory overview of the large cardinal hierarchy in set theory. By a large cardinal, we mean any cardinal $\kappa$ whose existence is strong enough of an assumption to prove the consistency of…

Logic · Mathematics 2022-05-05 Rohan Srivastava

It is shown that any denumerable list L to which Cantor's diagonal method was applied is incomplete. However, this doesn't allow us to affirm that the cardinality of the real numbers of the interval [0, 1] is greater than the cardinality of…

General Mathematics · Mathematics 2007-05-23 Jailton C. Ferreira

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

Logic · Mathematics 2019-01-29 Saharon Shelah

An extension of the divisibility relation on $\mathbb{N}$ to the set $\beta\mathbb{N}$ of ultrafilters on $\mathbb{N}$ was defined and investigated in several papers during the last ten years. Here we make a survey of results obtained so…

Logic · Mathematics 2024-01-09 Boris Šobot

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

Logic · Mathematics 2020-07-10 Gabriel Goldberg

The following work is an exploration into certain topics in the broad world of integrable models, both classical and quantum, and consists of two main parts of roughly equal length. The first part, consisting of chapters 1-3, concerns…

Mathematical Physics · Physics 2012-08-29 M Zuparic

We introduce the strongly uplifting cardinals, which are equivalently characterized, we prove, as the superstrongly unfoldable cardinals and also as the almost hugely unfoldable cardinals, and we show that their existence is equiconsistent…

Logic · Mathematics 2014-11-03 Joel David Hamkins , Thomas A. Johnstone

We discuss two general aspects of the theory of cardinal characteristics of the continuum, especially of proofs of inequalities between such characteristics. The first aspect is to express the essential content of these proofs in a way that…

Logic · Mathematics 2008-02-03 Andreas Blass

Miller's 1937 splitting theorem was proved for pairs of cardinals $(\n,\rho)$ in which $n$ is finite and $\rho$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(\nu,\rho)$ in which $\nu$ is…

Combinatorics · Mathematics 2013-05-17 Menachem Kojman

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…

Logic in Computer Science · Computer Science 2013-02-05 Giorgi Japaridze

The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…

Group Theory · Mathematics 2021-07-01 Arman Darbinyan

We prove a weakened version of the reflection of Reinhardt cardinals by super Reinhardt cardinals: Let $M=(V^M,P)$ be a countable model of second order set theory $\mathsf{ZF}_2$ (with universe $V^M$ and classes $P$) which models "$\kappa$…

Logic · Mathematics 2020-05-25 Farmer Schlutzenberg

We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…

Rings and Algebras · Mathematics 2015-12-15 Gábor Czédli

Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably…

Logic in Computer Science · Computer Science 2019-04-18 Peter Baumgartner , Uwe Waldmann

The $2n$ dimensional manifold with two mutually commutative operators of differentiation is introduced. Nontrivial multidimensional integrable systems connected with arbitrary graded (semisimple) algebras are constructed. The general…

Mathematical Physics · Physics 2007-05-23 A. N. Leznov

Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…

Logic · Mathematics 2025-06-17 Yong Cheng

We introduce 0^h (0^handgrenade) as a sharp for an inner model with a proper class of strong cardinals. If 0^h does not exist then any normal iteration tree is "almost linear." We exploit this fact to prove the existence of the core model K…

Logic · Mathematics 2007-05-23 Ralf-Dieter Schindler