相关论文: Infinite sets are non-denumerable

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

A Q-set is an uncountable set of reals all of whose subsets are relative $G_\delta$ sets. We prove that, for an arbitrary uncountable cardinal kappa, there is consistently a Q-set of size $\kappa$ whose square is not Q. This answers a…

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

In 1895, Cantor showed that between every two countable dense real sets, there is an order isomorphism. In fact, there is always such an order isomorphism, which is the restriction of a universal entire function.

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Cantor's first set theory paper (1874) establishes the uncountability of $\mathbb{R}$. We study this most basic mathematical fact formulated in the language of higher-order arithmetic. In particular, we investigate the logical and…

We show that there exist closed manifolds with arbitrarily small transcendental simplicial volumes. Moreover, we exhibit an explicit uncountable family of (transcendental) real numbers that are not realised as the simplicial volume of a…

For any analytically finite Riemann surface, the Teichm\"uller modular group is countable, but it is not easy to find an analytically infinite Riemann surface for which the Teichm\"uller modular group is countable. In this paper, we show…

It is well known that the set of algebraic numbers (let us call it $A$) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using \G1-based…

We consider embeddings between infinite graphs. In particular, We establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.

We give simple necessary and sufficient conditions for the inclusion-exclusion identity to hold for an infinite countable number of sets. In terms of a random variable, whose range are nonnegative integers, this condition is equivalent to…

How many odd numbers are there? How many even numbers? From Galileo to Cantor, the suggestion was that there are the same number of odd, even and natural numbers, because all three sets can be mapped in one-one fashion to each other. This…

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…

We pursue the idea of generalizing Hindman's Theorem to uncountable cardinalities, by analogy with the way in which Ramsey's Theorem can be generalized to weakly compact cardinals. But unlike Ramsey's Theorem, the outcome of this paper is…

By closely rereading the original Turing's 1936 article, we can gain insight about that it is based on the claim to have defined a number which is not computable, arguing that there can be no machine computing the diagonal on the…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences. There are only countably many such properties, so it…