display all the ideas for this combination of texts
8 ideas
| 9020 | My logical grammar has sentences by predication, then negation, conjunction, and existential quantification [Quine] |
| Full Idea: We chose a standard grammar in which the simple sentences are got by predication, and all further sentences are generated from these by negation, conjunction, and existential quantification. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.3) | |
| A reaction: It is interesting that we 'choose' our logic, apparently guided by an imperative to achieve minimal ontology. Of these basic ingredients, negation and predication are the more mysterious, especially the latter. Quine is a bit of an 'ostrich' about that. |
| 9028 | Maybe logical truth reflects reality, but in different ways in different languages [Quine] |
| Full Idea: Perhaps the logical truths owe their truth to certain traits of reality which are reflected in one way by the grammar of our language, in another way by the grammar of another language, and in a third way by the grammar and lexicon of a third language. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.7) | |
| A reaction: This explains Quine's subsequent interest in translation, and the interest of his pupil Davidson in charity, and whether there could actually be rival conceptual schemes. I like the link between logical truths and reality, which follows Russell. |
| 13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
| Full Idea: I don't believe English is by nature classical or intuitionistic etc. These are abstractions made by logicians. Logicians attend to numerous different objects that might be served by 'If...then', like material conditional, strict or relevant implication. | |
| From: Ian Hacking (What is Logic? [1979], §15) | |
| A reaction: The idea that they are 'abstractions' is close to my heart. Abstractions from what? Surely 'if...then' has a standard character when employed in normal conversation? |
| 13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
| Full Idea: First-order logic is the strongest complete compact theory with a Löwenheim-Skolem theorem. | |
| From: Ian Hacking (What is Logic? [1979], §13) |
| 13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
| Full Idea: Henkin proved that there is no first-order treatment of branching quantifiers, which do not seem to involve any idea that is fundamentally different from ordinary quantification. | |
| From: Ian Hacking (What is Logic? [1979], §13) | |
| A reaction: See Hacking for an example of branching quantifiers. Hacking is impressed by this as a real limitation of the first-order logic which he generally favours. |
| 10014 | Quine rejects second-order logic, saying that predicates refer to multiple objects [Quine, by Hodes] |
| Full Idea: Quine is unwilling to suppose second-order logic intelligible. He holds to Mill's account of the referential role of a predicate: it multiply denotes any and all objects to which it applies, and there is no need for a further 'predicative' entity. | |
| From: report of Willard Quine (Philosophy of Logic [1970]) by Harold Hodes - Logicism and Ontological Commits. of Arithmetic p.130 | |
| A reaction: If we assume that 'quantifying over' something is a commitment to its existence, then I think I am with Quine, because you end up with a massive commitment to universals, which I prefer to avoid. |
| 10828 | Quantifying over predicates is treating them as names of entities [Quine] |
| Full Idea: To put the predicate letter 'F' in a quantifier is to treat predicate position suddenly as name position, and hence to treat predicates as names of entities of some sort. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.5) | |
| A reaction: It is tricky to distinguish quantifying over predicates in a first-order way (by reifying them), and in a second-order way (where it is not clear whether you are quantifying over a property or a unified set of things. |
| 13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
| Full Idea: Second-order logic has no chance of a completeness theorem unless one ventures into intensional entities and possible worlds. | |
| From: Ian Hacking (What is Logic? [1979], §13) |