A new perspective of countable and uncountable infinite set on Georg Cantor’s definition in set theory

Author(s):  
Shee-Ping Chen

Abstract Georg Cantor defined countable and uncountable sets for infinite sets. Natural number set is defined as a countable set, and real number set is proven as an uncountable set by Cantor’s diagonal method. However, in this paper, natural number set will be proven as an uncountable set using Cantor’s diagonal method, and real number set will be proven as a countable set by Cantor’s definition. The process of argumentation provides us new perspectives to consider about the size of infinite sets.

2021 ◽  
Author(s):  
Shee-Ping Chen

Abstract Georg Cantor defined countable and uncountable sets for infinite sets. Natural number set is defined as a countable set, and real number set is proven as an uncountable set by Cantor’s diagonal method. However, in this paper, natural number set will be proven as an uncountable set using Cantor’s diagonal method, and real number set will be proven as a countable set by Cantor’s definition. The process of argumentation provides us new perspectives to consider about the size of infinite sets.


Kybernetes ◽  
2008 ◽  
Vol 37 (3/4) ◽  
pp. 453-457 ◽  
Author(s):  
Wujia Zhu ◽  
Yi Lin ◽  
Guoping Du ◽  
Ningsheng Gong

PurposeThe purpose is to show that all uncountable infinite sets are self‐contradictory non‐sets.Design/methodology/approachA conceptual approach is taken in the paper.FindingsGiven the fact that the set N={x|n(x)} of all natural numbers, where n(x)=df “x is a natural number” is a self‐contradicting non‐set in this paper, the authors prove that in the framework of modern axiomatic set theory ZFC, various uncountable infinite sets are either non‐existent or self‐contradicting non‐sets. Therefore, it can be astonishingly concluded that in both the naive set theory or the modern axiomatic set theory, if any of the actual infinite sets exists, it must be a self‐contradicting non‐set.Originality/valueThe first time in history, it is shown that such convenient notion as the set of all real numbers needs to be reconsidered.


Author(s):  
John P. Burgess

In the late nineteenth century, Georg Cantor created mathematical theories, first of sets or aggregates of real numbers (or linear points), and later of sets or aggregates of arbitrary elements. The relationship of element a to set A is written a∈A; it is to be distinguished from the relationship of subset B to set A, which holds if every element of B is also an element of A, and which is written B⊆A. Cantor is most famous for his theory of transfinite cardinals, or numbers of elements in infinite sets. A subset of an infinite set may have the same number of elements as the set itself, and Cantor proved that the sets of natural and rational numbers have the same number of elements, which he called ℵ0; also that the sets of real and complex numbers have the same number of elements, which he called c. Cantor proved ℵ0 to be less than c. He conjectured that no set has a number of elements strictly between these two. In the early twentieth century, in response to criticism of set theory, Ernst Zermelo undertook its axiomatization; and, with amendments by Abraham Fraenkel, his have been the accepted axioms ever since. These axioms help distinguish the notion of a set, which is too basic to admit of informative definition, from other notions of a one made up of many that have been considered in logic and philosophy. Properties having exactly the same particulars as instances need not be identical, whereas sets having exactly the same elements are identical by the axiom of extensionality. Hence for any condition Φ there is at most one set {x|Φ(x)} whose elements are all and only those x such that Φ(x) holds, and {x|Φ(x)}={x|Ψ(x)} if and only if conditions Φ and Ψ hold of exactly the same x. It cannot consistently be assumed that {x|Φ(x)} exists for every condition Φ. Inversely, the existence of a set is not assumed to depend on the possibility of defining it by some condition Φ as {x|Φ(x)}. One set x0 may be an element of another set x1 which is an element of x2 and so on, x0∈x1∈x2∈…, but the reverse situation, …∈y2∈y1∈y0, may not occur, by the axiom of foundation. It follows that no set is an element of itself and that there can be no universal set y={x|x=x}. Whereas a part of a part of a whole is a part of that whole, an element of an element of a set need not be an element of that set. Modern mathematics has been greatly influenced by set theory, and philosophies rejecting the latter must therefore reject much of the former. Many set-theoretic notations and terminologies are encountered even outside mathematics, as in parts of philosophy: pair {a,b} {x|x=a or x=b} singleton {a} {x|x=a} empty set ∅ {x|x≠x} union ∪X {a|a∈A for some A∈X} binary union A∪B {a|a∈A or a∈B} intersection ∩X {a|a∈A for all A∈X} binary intersection A∩B {a|a∈A and a∈B} difference A−B {a|a∈A and not a∈B} complement A−B power set ℘(A) {B|B⊆A} (In contexts where only subsets of A are being considered, A-B may be written -B and called the complement of B.) While the accepted axioms suffice as a basis for the development not only of set theory itself, but of modern mathematics generally, they leave some questions about transfinite cardinals unanswered. The status of such questions remains a topic of logical research and philosophical controversy.


2020 ◽  
Author(s):  
Vasil Dinev Penchev

A concept of formal transcendentalism is utilized. The fundamental and definitive property of the totality suggests for “the totality to be all”, thus, its externality (unlike any other entity) is contained within it. This generates a fundamental (or philosophical) “doubling” of anything being referred to the totality, i.e. considered philosophically. Thus, that doubling as well as transcendentalism underlying it can be interpreted formally as an elementary choice such as a bit of information and a quantity corresponding to the number of elementary choices to be defined. This is the quantity of information defined both transcendentally and formally and thus, philosophically and mathematically. If one defines information specifically, as an elementary choice between finiteness (or mathematically, as any natural number of Peano arithmetic) and infinity (i.e. an actually infinite set in the meaning of set theory), the quantity of quantum information is defined. One can demonstrate that the so-defined quantum information and quantum information standardly defined by quantum mechanics are equivalent to each other. The equivalence of the axiom of choice and the well-ordering “theorem” is involved. It can be justified transcendentally as well, in virtue of transcendental equivalence implied by the totality. Thus, all can be considered as temporal as far anything possesses such a temporal counterpart necessarily. Formally defined, the frontier of time is the current choice now, a bit of information, furthermore interpretable as a qubit of quantum information.


2020 ◽  
Author(s):  
Vasil Dinev Penchev

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”.


2016 ◽  
Vol 15 (1) ◽  
pp. 46-70
Author(s):  
Lior Rabi

Abstract Ortega y Gasset is known for his philosophy of life and his effort to propose an alternative to both realism and idealism. The goal of this article is to focus on an unfamiliar aspect of his thought. The focus will be given to Ortega’s interpretation of the advancements in modern mathematics in general and Cantor’s theory of transfinite numbers in particular. The main argument is that Ortega acknowledged the historical importance of the Cantor’s Set Theory, analyzed it and articulated a response to it. In his writings he referred many times to the advancements in modern mathematics and argued that mathematics should be based on the intuition of counting. In response to Cantor’s mathematics Ortega presented what he defined as an ‘absolute positivism’. In this theory he did not mean to naturalize cognition or to follow the guidelines of the Comte’s positivism, on the contrary. His aim was to present an alternative to Cantor’s mathematics by claiming that mathematicians are allowed to deal only with objects that are immediately present and observable to intuition. Ortega argued that the infinite set cannot be present to the intuition and therefore there is no use to differentiate between cardinals of different infinite sets.


1995 ◽  
Vol 60 (2) ◽  
pp. 374-391 ◽  
Author(s):  
Haim Judah ◽  
Andrzej Rosłanowski

Since Georg Cantor discovered set theory the main problem in this area of mathematical research has been to discover what is the size of the continuum. The continuum hypothesis (CH) says that every infinite set of reals either has the same cardinality as the set of all reals or has the cardinality of the set of natural numbers, namelyIn 1939 Kurt Gödel discovered the Constructible Universe and proved that CH holds in it. In the early sixties Paul Cohen proved that every universe of set theory can be extended to a bigger universe of set theory where CH fails. Moreover, given any reasonable cardinal κ, it is possible to build a model where the continuum size is κ. The new technique discovered by Cohen is called forcing and is being used successfully in other branches of mathematics (analysis, algebra, graph theory, etc.).In the light of these two stupendous works the experts (especially the platonists) were forced to conclude that from the point of view of the classical axiomatization of set theory (called ZFC) it is impossible to give any answer to the continuum size problem: everything is possible!In private communications Gödel suggested that the continuum size from a platonistic point of view should be ω2, the second uncountable cardinal. As this is not provable in ZFC, Gödel suggested that a new axiom should be added to ZFC to decide that the cardinality of the continuum is ω2.


Axiomathes ◽  
2021 ◽  
Author(s):  
Andrew Powell

AbstractThis article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy of ordinal recursive functionals of arbitrary type that can be reduced by substitution to natural number functions.


2010 ◽  
Vol 75 (3) ◽  
pp. 996-1006 ◽  
Author(s):  
Kyriakos Keremedis ◽  
Eleftherios Tachtsis

AbstractWe establish the following results:1. In ZF (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC), for every set I and for every ordinal number α ≥ ω, the following statements are equivalent:(a) The Tychonoff product of ∣α∣ many non-empty finite discrete subsets of I is compact.(b) The union of ∣α∣ many non-empty finite subsets of I is well orderable.2. The statement: For every infinite set I, every closed subset of the Tychonoff product [0, 1]Iwhich consists offunctions with finite support is compact, is not provable in ZF set theory.3. The statement: For every set I, the principle of dependent choices relativised to I implies the Tychonoff product of countably many non-empty finite discrete subsets of I is compact, is not provable in ZF0 (i.e., ZF minus the Axiom of Regularity).4. The statement: For every set I, every ℵ0-sized family of non-empty finite subsets of I has a choice function implies the Tychonoff product of ℵ0many non-empty finite discrete subsets of I is compact, is not provable in ZF0.


Author(s):  
Howard Stein

Dedekind is known chiefly, among philosophers, for contributions to the foundations of the arithmetic of the real and the natural numbers. These made available for the first time a systematic and explicit way, starting from very general notions (which Dedekind himself regarded as belonging to logic), to ground the differential and integral calculus without appeal to geometric ‘intuition’. This work also forms a pioneering contribution to set theory (further advanced in Dedekind’s correspondence with Georg Cantor) and to the general notion of a ‘mathematical structure’. Dedekind’s foundational work had a close connection with his advancement of substantive mathematical knowledge, particularly in the theories of algebraic numbers and algebraic functions. His achievements in these fields make him one of the greatest mathematicians of the nineteenth century.


Sign in / Sign up

Export Citation Format

Share Document