display all the ideas for this combination of texts
4 ideas
| 16150 | One is, so numbers exist, so endless numbers exist, and each one must partake of being [Plato] |
| Full Idea: If one is, there must also necessarily be number - Necessarily - But if there is number, there would be many, and an unlimited multitude of beings. ..So if all partakes of being, each part of number would also partake of it. | |
| From: Plato (Parmenides [c.364 BCE], 144a) | |
| A reaction: This seems to commit to numbers having being, then to too many numbers, and hence to too much being - but without backing down and wondering whether numbers had being after all. Aristotle disagreed. |
| 10265 | Chihara's system is a variant of type theory, from which he can translate sentences [Chihara, by Shapiro] |
| Full Idea: Chihara's system is a version of type theory. Translate thus: replace variables of sets of type n with level n variables over open sentences, replace membership/predication with satisfaction, and high quantifiers with constructability quantifiers. | |
| From: report of Charles Chihara (Constructibility and Mathematical Existence [1990]) by Stewart Shapiro - Philosophy of Mathematics 7.4 |
| 8759 | We can replace type theory with open sentences and a constructibility quantifier [Chihara, by Shapiro] |
| Full Idea: Chihara's system is similar to simple type theory; he replaces each type with variables over open sentences, replaces membership (or predication) with satisfaction, and replaces quantifiers over level 1+ variables with constructability quantifiers. | |
| From: report of Charles Chihara (Constructibility and Mathematical Existence [1990]) by Stewart Shapiro - Thinking About Mathematics 9.2 | |
| A reaction: This is interesting for showing that type theory may not be dead. The revival of supposedly dead theories is the bread-and-butter of modern philosophy. |
| 10264 | Introduce a constructibility quantifiers (Cx)Φ - 'it is possible to construct an x such that Φ' [Chihara, by Shapiro] |
| Full Idea: Chihara has proposal a modal primitive, a 'constructability quantifier'. Syntactically it behaves like an ordinary quantifier: Φ is a formula, and x a variable. Then (Cx)Φ is a formula, read as 'it is possible to construct an x such that Φ'. | |
| From: report of Charles Chihara (Constructibility and Mathematical Existence [1990]) by Stewart Shapiro - Philosophy of Mathematics 7.4 | |
| A reaction: We only think natural numbers are infinite because we see no barrier to continuing to count, i.e. to construct new numbers. We accept reals when we know how to construct them. Etc. Sounds promising to me (though not to Shapiro). |