display all the ideas for this combination of texts
4 ideas
| 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. |
| 13471 | Mathematics makes existence claims, but philosophers usually say those are never analytic [Hart,WD] |
| Full Idea: The thesis that no existence proposition is analytic is one of the few constants in philosophical consciences, but there are many existence claims in mathematics, such as the infinity of primes, five regular solids, and certain undecidable propositions. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) |
| 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). |