Namespaces
Variants
Actions

Difference between revisions of "User:Whayes43"

From Encyclopedia of Mathematics
Jump to: navigation, search
 
(12 intermediate revisions by the same user not shown)
Line 1: Line 1:
==Cantor's general theory of sets==
+
Each statement of a syllogism is one of 4 types, as follows:
  
It was a widespread idea in the late nineteenth century, that pure mathematics was nothing but an elaborate form of arithmetic and, further, that the “arithmetisation” of mathematics had brought about higher standards of rigor… This viewpoint led to the idea of grounding all of pure mathematics in logic and set theory, which proceeded in two steps:<ref>Ferreirós (2011b) § 3</ref>
+
::{| class="wikitable"
# the establishment of a theory of the real numbers (arithmetization of analysis)
+
|-
# the set-theoretic definition of the natural numbers and axiomatization of arithmetic
+
! Type !! Statement !! Alternative
Infinite sets had been needed for an adequate definition of important mathematical notions, such as limit and irrational numbers. It was this initial use that led Cantor himself to begin studying infinite sets “in their own right.”<ref>Lavine pp. 38, 41 cited in Curtis p. 87</ref>
+
|-
 
+
| style="text-align: center;" | '''A''' || '''All''' $A$ '''are''' $B$ ||
In 1883, Cantor began his general theory of sets with the publication of ''Foundations of a General Theory of Manifolds'' (the ''Grundlagen''). Among other things, in this paper he made the interesting and somewhat self-justifying claim of the autonomy of pure mathematics:
+
|-
* pure mathematics may be concerned with systems of objects which have no known relation to empirical phenomena at all<ref>Tait p. 11</ref>
+
| style="text-align: center;" | '''I''' || '''Some''' $A$ '''are''' $B$ ||
* any concepts may be introduced subject only to the condition that they are free of contradiction and defined in terms of previously accepted concepts<ref>O’Connor and Robertson (1996)</ref>
+
|-
 
+
| style="text-align: center;" | '''E''' || '''No''' $A$ '''are''' $B$ || (= '''All''' $A$ '''are not''' $B$)
Cantor’s overall purpose, however, was to develop a theory of transfinite numbers.<ref>Tait p. 6</ref> The significance of Cantor’s general theory of sets not only for the process of mathematical rigourization generally, but also for what Hilbert would later state as his 2nd problem particularly, was this:<ref>Ferreirós (2011b) § 3</ref>
+
|-
::precisely when mathematicians were celebrating that “full rigor” had been finally attained, serious problems emerged for the foundations of set theory.
+
| style="text-align: center;" | '''O''' || '''Not All''' $A$ '''are''' $B$ || (= '''Some''' $A$ '''are not''' $B$)
 
+
|}
Neither the initial introduction of infinite sets by others nor their use in his early theory of sets by Cantor himself had been problematic. However, Cantor’s subsequent introduction of transfinite numbers and development of transfinite arithmetic made him aware of the potential for paradoxes within set theory.
 
 
 
Cantor is said to have attributed the source of these paradoxes to the following:<ref>Ferreirós (2011b) § 3</ref>
 
* the use (by Frege) of an unrestricted principle of comprehension
 
* the acceptance (by Dedekind) of arbitrary subsets of a Universal Set (''Gedankenwelt'')
 
 
 
More specifically, the claim is that Cantor himself traced the paradoxes to a faulty understanding (by others) of what constitutes a legitimate mathematical collection. For Cantor, the mathematically relevant notion of a collection is said to have been based on the “combinatorial concept” of a set:<ref>Lavine pp. 53-54 cited in Curtis pp. 87-88</ref>
 
::In order to be treated as a whole, [a mathematical collection] must be capable of being counted, in a broad sense of "count" which means ''well-orderable''.
 
In contrast to this was the “logical concept” of a set, developed by Frege, accepted by Dedekind, and championed by Russell, which “treats collections as the extensIons of concepts”:<ref>Lavine p. 63 cited in Curtis</ref>
 
::For a multiplicity to be treated as a mathematical whole, we must have some propositional function which acts as a rule for picking out all of the members.
 
The point of this contrast rests on the claim that the set-theoretic paradoxes are only a problem for the logical concept of a set, which includes the inconsistent Comprehension Principle, and has Russell's Paradox as a result.<ref>Lavine p. 66 cited in Curtis</ref>
 
 
 
The general consensus, however, is that it was Cantor’s own construction of the system of transfinite numbers, employing as it did the concept ''class of numbers'', that introduced foundational problems into mathematics by asking this question:<ref>Tait p. 21</ref>
 
::What cardinal numbers are there?
 
 
 
In the ''Grundlagen'', there was a significant change in Cantor’s conception of a set, which he defined as follows:<ref>Tait p. 18 ''emphasis'' added</ref>
 
::any multiplicity which can be thought of as one, i.e. any aggregate (''inbegriff'') of determinate elements ''that can be united into a whole'' by some law.
 
With the introduction of the transfinite numbers, Cantor immediately recognized that this notion of set was problematic:<ref>Tait p. 23</ref>
 
::not every property of numbers “unites the objects possessing it into a whole”
 
 
 
The most notable changes in this from his earlier explanation of the concept of set are these:<ref>Tait p. 18</ref>
 
* the absence of any reference to a prior conceptual sphere or domain from which the elements of the set are drawn
 
* the modification according to which the property or “law” which determines elementhood in the set “unites them into a whole”
 
 
 
. . . . .
 
 
 
<references/>
 
. . . . .
 
 
 
==References==
 
 
 
* Curtis, G N. (1995). “The ‘Villain’ of Set Theory,” [Review of Lavine, S. (1994). ''Understanding the Infinite'', Harvard Univ. Press], ''Russell: The Journal of Bertrand Russell Studies'', Vol. 15, No. 1, 1995, McMaster University, URL: https://escarpmentpress.org/russelljournal/article/viewFile/1882/1908, Accessed: 2015/07/16.
 

Latest revision as of 13:39, 14 October 2015

Each statement of a syllogism is one of 4 types, as follows:

Type Statement Alternative
A All $A$ are $B$
I Some $A$ are $B$
E No $A$ are $B$ (= All $A$ are not $B$)
O Not All $A$ are $B$ (= Some $A$ are not $B$)
How to Cite This Entry:
Whayes43. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Whayes43&oldid=36760