display all the ideas for this combination of philosophers
5 ideas
| 9553 | Analytic geometry gave space a mathematical structure, which could then have axioms [Chihara] |
| Full Idea: With the invention of analytic geometry (by Fermat and then Descartes) physical space could be represented as having a mathematical structure, which could eventually lead to its axiomatization (by Hilbert). | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 02.3) | |
| A reaction: The idea that space might have axioms seems to be pythagoreanism run riot. I wonder if there is some flaw at the heart of Einstein's General Theory because of this? |
| 10192 | We can replace existence of sets with possibility of constructing token sentences [Chihara, by MacBride] |
| Full Idea: Chihara's 'constructability theory' is nominalist - mathematics is reducible to a simple theory of types. Instead of talk of sets {x:x is F}, we talk of open sentences Fx defining them. Existence claims become constructability of sentence tokens. | |
| From: report of Charles Chihara (A Structural Account of Mathematics [2004]) by Fraser MacBride - Review of Chihara's 'Structural Acc of Maths' p.81 | |
| A reaction: This seems to be approaching the problem in a Fregean way, by giving an account of the semantics. Chihara is trying to evade the Quinean idea that assertion is ontological commitment. But has Chihara retreated too far? How does he assert existence? |
| 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). |