display all the ideas for this combination of philosophers
4 ideas
11115 | 'All horses' either picks out the horses, or the things which are horses [Jubien] |
Full Idea: Two ways to see 'all horses are animals' are as picking out all the horses (so that it is a 'horse-quantifier'), ..or as ranging over lots of things in addition to horses, with 'horses' then restricting the things to those that satisfy 'is a horse'. | |
From: Michael Jubien (Analyzing Modality [2007], 2) | |
A reaction: Jubien says this gives you two different metaphysical views, of a world of horses etc., or a world of things which 'are horses'. I vote for the first one, as the second seems to invoke an implausible categorical property ('being a horse'). Cf Idea 11116. |
13392 | Philosophers reduce complex English kind-quantifiers to the simplistic first-order quantifier [Jubien] |
Full Idea: There is a readiness of philosophers to 'translate' English, with its seeming multitude of kind-driven quantifiers, into first-order logic, with its single wide-open quantifier. | |
From: Michael Jubien (Possibility [2009], 4.1) | |
A reaction: As in example he says that reference to a statue involves a 'statue-quantifier'. Thus we say things about the statue that we would not say about the clay, which would involve a 'clay-quantifier'. |
9469 | Substitutional existential quantifier may explain the existence of linguistic entities [Parsons,C] |
Full Idea: I argue (against Quine) that the existential quantifier substitutionally interpreted has a genuine claim to express a concept of existence, which may give the best account of linguistic abstract entities such as propositions, attributes, and classes. | |
From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.156) | |
A reaction: Intuitively I have my doubts about this, since the whole thing sounds like a verbal and conventional game, rather than anything with a proper ontology. Ruth Marcus and Quine disagree over this one. |
9468 | On the substitutional interpretation, '(∃x) Fx' is true iff a closed term 't' makes Ft true [Parsons,C] |
Full Idea: For the substitutional interpretation of quantifiers, a sentence of the form '(∃x) Fx' is true iff there is some closed term 't' of the language such that 'Ft' is true. For the objectual interpretation some object x must exist such that Fx is true. | |
From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.156) | |
A reaction: How could you decide if it was true for 't' if you didn't know what object 't' referred to? |