English
Related papers

Related papers: Foundations with Imagination

200 papers

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

Logic · Mathematics 2019-07-23 John Krueger

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

General Mathematics · Mathematics 2021-06-15 Marcoen J. T. F. Cabbolet

We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .

Logic · Mathematics 2008-02-03 Saharon Shelah

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

Logic · Mathematics 2024-12-02 Emanuele Frittaion , Takako Nemoto , Michael Rathjen

We give an example of a definable quotient in an o-minimal structure which cannot be eliminated over any set of parameters, giving a negative answer to a question of Eleftheriou, Peterzil, and Ramakrishnan. Equivalently, there is an…

Logic · Mathematics 2019-11-26 Will Johnson

In this paper, we prove that $\mathsf{ZFC+WA}_{n+1}$ implies the consistency of $\mathsf{ZFC+WA}_n$ for $n\ge 0$. We also prove that $\mathsf{ZFC+WA}_n$ is finitely axiomatizable, and $\mathsf{ZFC+WA}$ is not finitely axiomatizable.

Logic · Mathematics 2025-03-19 Hanul Jeon

Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…

General Mathematics · Mathematics 2009-09-29 W. Mueckenheim

This paper introduces a new theory which encompasses concepts and ideas from set theory, type theory, and Le\'{s}niewski's mereology and describes its possibility as an alternative foundation for mathematics. In the introduction section I…

Logic · Mathematics 2016-09-15 Jin Hoo Lee

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Logic · Mathematics 2007-05-23 Wilfrid Hodges , Saharon Shelah

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

We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an omega-language…

Formal Languages and Automata Theory · Computer Science 2012-02-02 Olivier Finkel

In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…

General Topology · Mathematics 2014-05-26 Rodrigo R. Dias , Franklin D. Tall

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

Logic in Computer Science · Computer Science 2015-07-01 Wojciech Moczydlowski

We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $\omega_1$-like models of set theory. Specifically, under the $\diamondsuit$…

Logic · Mathematics 2015-01-07 Gunter Fuchs , Victoria Gitman , Joel David Hamkins

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

Logic · Mathematics 2018-01-30 Dilip Raghavan , Saharon Shelah

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

Logic · Mathematics 2022-03-11 Ali Enayat

We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…

Logic · Mathematics 2017-07-25 Andre Kornell

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

In partial answer to a question posed by Arnie Miller (http://www.math.wisc.edu/~miller/res/problem.pdf) and X. Caicedo, we obtain sufficient conditions for an L_{omega_1,omega} theory to have an independent axiomatization. As a consequence…

Logic · Mathematics 2010-12-16 Greg Hjorth , Ioannis Souldatos