相关论文: Three beliefs that lend illusory legitimacy to Can…

Remarks on the Cantor's nondenumerability proof of 1891 that the real numbers are noncountable will be given. By the Cantor's diagonal procedure, it is not possible to build numbers that are different from all numbers in a general assumed…

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves…

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…

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

It is shown that the pillars of transfinite set theory, namely the uncountability proofs, do not hold. (1) Cantor's first proof of the uncountability of the set of all real numbers does not apply to the set of irrational numbers alone, and,…

For more than a century, Cantor's theory of transfinite numbers has played a pivotal role in set theory, with ramifications that extend to many areas of mathematics. This article extends earlier findings with a fresh look at the critical…

For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…

In 1891 Cantor presented two proofs with the purpose to establish a general theorem that any set can be replaced by a set of greater power. Cantor's power set theorem can be considered to be an extension of Cantor's 1891 second proof and…

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…

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…

In a recent historical overview, Cristian S. Calude, Elena Calude, and Solomon Marcus identify eight stages in the development of the concept of a mathematical proof in support of an ambitious conjecture: we can express classical…

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…

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…

The proofs that the real numbers are denumerable will be shown, i.e., that there exists one-to-one correspondence between the natural numbers $N$ and the real numbers $\Re$. The general element of the sequence that contains all real numbers…

A common question from students on the usual diagonalization proof for the uncountability of the set of real numbers is: when a representation of real numbers, such as the decimal expansions of real numbers, allows us to use the…

In this article, we explore the notion of infinity by studying Cantor's contribution to this field. A brief history of set theory is given. As an example of infinity, we consider Hilbert's famous hotel. A graphical construction is used to…

Since the theory developed by Georg Cantor, mathematicians have taken a sharp interest in the sizes of infinite sets. We know that the set of integers is infinitely countable and that its cardinality is Aleph0. Cantor proved in 1891 with…

Standard expositions of Goedel's 1931 paper on undecidable arithmetical propositions are based on two presumptions in Goedel's 1931 interpretation of his own, formal, reasoning - one each in Theorem VI and in Theorem XI - which do not meet…

The article is devoted to the alternating Cantor series. It is proved that any real number belonging to $[a_0-1;a_0]$, where $a_0=\sum^{\infty} _{k=1} {\frac{d_{2k}-1}{d_1d_2...d_{2k}}} $, has no more than two representations by the series…