English
Related papers

Related papers: Inaccessibility and Subinaccessibility. In two par…

200 papers

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

Logic · Mathematics 2018-12-04 Eddy El Khalil

A system of singular integral equations with monotone and concave nonlinearity in the subcritical case is investigated. The specified system and its scalar analog have direct applications in various areas of physics and biology. In…

Functional Analysis · Mathematics 2024-10-28 A. Kh. Khachatryan , Kh. A. Khachatryan , H. S. Petrosyan

In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…

General Mathematics · Mathematics 2019-10-08 Jaykov Foukzon

We continue the work from [8] and make a small -- but significant -- improvement to the definition of $j$-decomposable system. This provides us with a better lifting of elementary embeddings to symmetric extensions. In particular, this…

Logic · Mathematics 2026-04-21 Yair Hayut , Asaf Karagila

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 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

Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…

Logic · Mathematics 2024-09-24 Fedor Pakhomov , Michael Rathjen , Dino Rossegger

This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…

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

This is the report-version of a mini-series of two articles on the foundations of satisfiability of conjunctive normal forms with non-boolean variables, to appear in Fundamenta Informaticae, 2011. These two parts are here bundled in one…

Discrete Mathematics · Computer Science 2012-02-15 Oliver Kullmann

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus…

Logic · Mathematics 2023-03-28 Athanassios Tzouvaras

In other work we have outlined how, building on ideas of Welch and Roberts, one can motivate believing in the existence of supercompact cardinals. After making this observation we strove to formulate a justification for large-cardinal…

Logic · Mathematics 2018-01-03 Rupert McCallum

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

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Logic · Mathematics 2015-08-04 Brent Cody , Sean Cox

Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but…

Computational Complexity · Computer Science 2023-06-06 Samuel Epstein

A sharper uncertainty inequality which exhibits a lower bound larger than that in the classical N-dimensional Heisenberg's uncertainty principle is obtained, and extended from N-dimensional Fourier transform domain to two N-dimensional…

Mathematical Physics · Physics 2019-06-14 Zhichao Zhang

This paper continues a line of investigation of the Halpern--L\"{a}uchli Theorem at uncountable cardinals. We prove in ZFC that the Halpern--L\"{a}uchli Theorem for one tree of height $\kappa$ holds whenever $\kappa$ is strongly…

Logic · Mathematics 2023-01-03 Natasha Dobrinen , Saharon Shelah

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

We study the existence of transformations of the transfinite plane that allow one to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classical partition relations for uncountable cardinals. To exemplify: we…

Logic · Mathematics 2021-07-01 Assaf Rinot , Jing Zhang

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

An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…

History and Overview · Mathematics 2018-08-15 Pietro Paparella