The theory of constructive types (principles of logic and mathematics). By Leon Chwistek.
Annotations Tools
12 n\ot-.x]). Now let us write r ()p) instead oi,,for some O4xe instead of,is identical with alnd c i. Ix îistead of,x: and tpx". With the help of these ideas. which seem to be essential to anly system of symbolic logic, we can build up the proposition: (ao?). (x = — a ~ SC which we shall denote by Qa. Now, it is easy to see that Qx is a contradictory object, we having propositions Q(Qx) and - QQx)1). To avoid such objects, there seems to be no other means than to suppose with Whitehead and Russell, that Qx can be no possible value of the argument of Qx, the idea of,all values of the argument of 0x" being not equivalent to the idea of,all objects". Moreover, we should assume that the idea of,all objects" is meaningless, we having a hierarchy of types of objects. Suppose we can speak ahout,,all properties of x" i. e., about;all propositional functions Ox such, that either ~x or -JO x". We shall have to deal 1~ with individuals i. e. objects being neither propositions lor propositional functions; 2~, with propositional functions whose arguments take individuals as possible values, i. e. propositional functions of the 1s type; 30, with propositional functions whose arguments take functions of the 1 type as possible values, i. e. propositional functions of the 2d type... and so on. Such a simple hierarchy of. types would be, as a matter of fact, sufficient to build up a self-consistent system of Symbolic Logic, there being no purely Logical paradoxes based on the idea of,all properties of x". Nevertheless, as this last idea does not exclude such contradictions, as Richard's paradox, or KI5nig's, it seems to be interesting to get a system of Symbolic Logic, free from such contradictions. To avoid these we must agree with Whitehead and Russell that the idea of,,all properties of x' is meaningless. Then we catnot speak about,all functi.,ns Ox such, that either qx or -SX", we having moreover a hierarchy of functions of different types (or, as we callI them, futnetions of different orders) having x as a possible value of their argument. We see that this seriously complicates the primitive theory of types. Now, such symbols as (x) i. e.,for ail x's" or (3x) i. e.,for some x's" have meaning only if x denotes individuals. To 1) Cf. Über die Antinomieen der Prinzipien der Mathematik, Mathemnatische Zeitschrift 1922,
-
Scan #1
Page #1
-
Scan #2
Page #2 - Title Page
-
Scan #3
Page #3
-
Scan #4
Page #4 - Title Page
-
Scan #5
Page #5
-
Scan #6
Page 9
-
Scan #7
Page 10
-
Scan #8
Page 11
-
Scan #9
Page 12
-
Scan #10
Page 13
-
Scan #11
Page 14
-
Scan #12
Page 15
-
Scan #13
Page 16
-
Scan #14
Page 17
-
Scan #15
Page 18
-
Scan #16
Page 19
-
Scan #17
Page 20
-
Scan #18
Page 21
-
Scan #19
Page 22
-
Scan #20
Page 23
-
Scan #21
Page 24
-
Scan #22
Page 25
-
Scan #23
Page 26
-
Scan #24
Page 27
-
Scan #25
Page 28
-
Scan #26
Page 29
-
Scan #27
Page 30
-
Scan #28
Page 31
-
Scan #29
Page 32
-
Scan #30
Page 33
-
Scan #31
Page 34
-
Scan #32
Page 35
-
Scan #33
Page 36
-
Scan #34
Page 37
-
Scan #35
Page 38
-
Scan #36
Page 39
-
Scan #37
Page 40
-
Scan #38
Page 41
-
Scan #39
Page 42
-
Scan #40
Page 43
-
Scan #41
Page 44
-
Scan #42
Page 45
-
Scan #43
Page 46
-
Scan #44
Page 47
-
Scan #45
Page 48
-
Scan #46
Page 49
-
Scan #47
Page 50
-
Scan #48
Page 51
-
Scan #49
Page 52
-
Scan #50
Page 53
-
Scan #51
Page 54
-
Scan #52
Page 55
-
Scan #53
Page 56
-
Scan #54
Page 57
-
Scan #55
Page 58
-
Scan #56
Page 59
-
Scan #57
Page 60
-
Scan #58
Page 61
-
Scan #59
Page 62
-
Scan #60
Page 63
-
Scan #61
Page 64
-
Scan #62
Page 65
-
Scan #63
Page 66
-
Scan #64
Page 67
-
Scan #65
Page 68
-
Scan #66
Page 69
-
Scan #67
Page 70
-
Scan #68
Page 71
-
Scan #69
Page 72
-
Scan #70
Page 73
-
Scan #71
Page 74
-
Scan #72
Page 75
-
Scan #73
Page 76
-
Scan #74
Page 77
-
Scan #75
Page 78
-
Scan #76
Page 79
-
Scan #77
Page 80
-
Scan #78
Page 81
-
Scan #79
Page 82
-
Scan #80
Page 83
-
Scan #81
Page 84
-
Scan #82
Page 85
-
Scan #83
Page 86
-
Scan #84
Page 87
-
Scan #85
Page 88
-
Scan #86
Page 89
-
Scan #87
Page 90
-
Scan #88
Page 91
-
Scan #89
Page 92
-
Scan #90
Page 93
-
Scan #91
Page 94
-
Scan #92
Page 95
-
Scan #93
Page 96
-
Scan #94
Page 97
-
Scan #95
Page 98
Actions
About this Item
- Title
- The theory of constructive types (principles of logic and mathematics). By Leon Chwistek.
- Author
- Chwistek, Leon, 1884-1944.
- Canvas
- Page viewer.nopagenum
- Publication
- Cracow,: University press,
- 1925.
- Subject terms
- Mathematics -- Philosophy
- Logic, Symbolic and mathematical
Technical Details
- Link to this Item
-
https://name.umdl.umich.edu/aas7985.0001.001
- Link to this scan
-
https://quod.lib.umich.edu/u/umhistmath/aas7985.0001.001/9
Rights and Permissions
The University of Michigan Library provides access to these materials for educational and research purposes. These materials are in the public domain in the United States. If you have questions about the collection, please contact Historical Mathematics Digital Collection Help at [email protected]. If you have concerns about the inclusion of an item in this collection, please contact Library Information Technology at [email protected].
DPLA Rights Statement: No Copyright - United States
Related Links
IIIF
- Manifest
-
https://quod.lib.umich.edu/cgi/t/text/api/manifest/umhistmath:aas7985.0001.001
Cite this Item
- Full citation
-
"The theory of constructive types (principles of logic and mathematics). By Leon Chwistek." In the digital collection University of Michigan Historical Math Collection. https://name.umdl.umich.edu/aas7985.0001.001. University of Michigan Library Digital Collections. Accessed May 13, 2025.