6 ideas
| 8758 | We could talk of open sentences, instead of sets [Chihara, by Shapiro] |
| Full Idea: Chihara's programme is to replace talk of sets with talk of open sentences. Instead of speaking of the set of all cats, we talk about the open sentence 'x is a cat'. | |
| From: report of Charles Chihara (Constructibility and Mathematical Existence [1990]) by Stewart Shapiro - Thinking About Mathematics 9.2 | |
| A reaction: As Shapiro points out, this is following up Russell's view that sets should be replaced with talk of properties. Chihara is expressing it more linguistically. I'm in favour of any attempt to get rid of sets. |
| 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). |
| 13128 | 'Ultimate sortals' cannot explain ontological categories [Westerhoff on Wiggins] |
| Full Idea: 'Ultimate sortals' are said to be non-subordinated, disjoint from one another, and uniquely paired with each object. Because of this, the ultimate sortal cannot be a satisfactory explication of the notion of an ontological category. | |
| From: comment on David Wiggins (Identity and Spatio-Temporal Continuity [1971], p.75) by Jan Westerhoff - Ontological Categories §26 | |
| A reaction: My strong intuitions are that Wiggins is plain wrong, and Westerhoff gives the most promising reasons for my intuition. The simplest point is that objects can obviously belong to more than one category. |
| 22235 | Feelings are not unchanging, but have a history (especially if they are noble) [Foucault] |
| Full Idea: We believe that feelings are immutable, but every sentiment, particularly the most noble and disinterested, has a history. | |
| From: Michel Foucault (Nietzsche, Genealogy, History [1971], p.86), quoted by Johanna Oksala - How to Read Foucault 5 | |
| A reaction: This is the sort of remark that makes me think Foucault is worth reading. Aristotle thought you could teach correct feelings. That implies that you can also teach incorrect feelings. |