English
Related papers

Related papers: Infinite sets are non-denumerable

200 papers

Let $m\geq 3$ be a positive integer. We prove that there are uncountably many non-commensurable metabelian uniform pro-$p$ groups of dimension $m$. Consequently, there are uncountably many non-commensurable finitely presented pro-$p$ groups…

Group Theory · Mathematics 2015-04-02 Ilir Snopce

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan

In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…

General Mathematics · Mathematics 2013-12-18 Qiu Kui Zhang

We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges…

Logic · Mathematics 2023-11-22 Nathanael Ackerman , Leah Karker , Mostafa Mirabi

When working in NF, [1] there is a sense that there are more non-Cantorian sets than Cantorian sets. But it is not that immediate result as one expects, since they are externally equinumerous, and the qualification "Cantorian" is not…

Logic · Mathematics 2025-03-14 Zuhair Al-Johar

By INF we mean Quine's NF set theory, with intuitionistic logic. We define the Church numerals (or better, Church numbers) and elaborate their properties in INF. The Church counting axiom says that iterating successor $n$ times, starting at…

Logic · Mathematics 2021-11-23 Michael Beeson

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

Conventional time is modelled as the one dimensional continuum R^1 of real numbers. This continuity, however, does {\em not} stem from {\em any} fundamental principle. On the other hand, natural time is {\em not} continuous and its values…

Other Condensed Matter · Physics 2007-05-23 P. A. Varotsos

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Group Theory · Mathematics 2017-04-21 Adam Clay , Kathryn Mann , Cristóbal Rivas

We discuss how singular can cardinals be in absence of the axiom of choice. We show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. Then we pose some problems.

Logic · Mathematics 2007-09-18 Denis I. Saveliev

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

Group Theory · Mathematics 2017-04-06 S. V. Ivanov

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

It is argued that zero should be considered as a cardinal number but not an ordinal number. One should make a clear distinction between order types that are labels for well-ordered sets and ordinal numbers that are labels for the elements…

History and Overview · Mathematics 2011-02-03 Peter Harremoës

We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…

Logic · Mathematics 2013-05-16 Jan Reimann , Theodore A. Slaman

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

Logic · Mathematics 2016-05-04 Philipp Hieronymi

Cantor gave in his fundamental article an elegant proof of the countability of real algebraic numbers based on a positive integer height, denoted by him as N, of integer and irreducible polynomials of given degree (denoted by him as n) with…

Number Theory · Mathematics 2023-07-21 Wolfdieter Lang

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

Computational Complexity · Computer Science 2015-05-07 Cristian S. Calude , Damien Desfontaines

We introduce the concept of inverse powerset by adding three axioms to the Zermelo-Fraenkel set theory. This extends the Zermelo-Fraenkel set theory with a new type of set which is motivated by an intuitive meaning and interesting…

Logic · Mathematics 2012-05-17 Patrick St-Amant

In this short note, we discuss the topology of Diophantine numbers, giving simple explicit examples of Diophantine isolated numbers (among those with same Diophantine constatnts), showing that, Diophantine sets are not always Cantor sets.…

Dynamical Systems · Mathematics 2024-02-02 Fernando Argentieri , Luigi Chierchia

We prove that there exists a countable infinite sequence of non-empty special $\Pi^0_1$ classes $\{\mathcal{P}_i\}_{i\in\omega}$ such that no infinite union of elements of any $\mathcal{P}_i$ computes the halting set. We then give a…

Logic · Mathematics 2018-07-20 Ahmet Çevik
‹ Prev 1 4 5 6 7 8 10 Next ›