display all the ideas for this combination of texts
21 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) |
| 8078 | Modus ponens is one of five inference rules identified by the Stoics [Chrysippus, by Devlin] |
| Full Idea: Modus ponens is just one of the five different inference rules identified by the Stoics. | |
| From: report of Chrysippus (fragments/reports [c.240 BCE]) by Keith Devlin - Goodbye Descartes Ch.2 | |
| A reaction: Modus ponens strikes me as being more like a definition of implication than a 'rule'. Implication is what gets you from one truth to another. All the implications of a truth must also be true. |
| 6023 | Every proposition is either true or false [Chrysippus, by Cicero] |
| Full Idea: We hold fast to the position, defended by Chrysippus, that every proposition is either true or false. | |
| From: report of Chrysippus (fragments/reports [c.240 BCE]) by M. Tullius Cicero - On Fate ('De fato') 38 | |
| A reaction: I am intrigued to know exactly how you defend this claim. It may depend what you mean by a proposition. A badly expressed proposition may have indeterminate truth, quite apart from the vague, the undecidable etc. |
| 9024 | Excluded middle has three different definitions [Quine] |
| Full Idea: The law of excluded middle, or 'tertium non datur', may be pictured variously as 1) Every closed sentence is true or false; or 2) Every closed sentence or its negation is true; or 3) Every closed sentence is true or not true. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.6) | |
| A reaction: Unlike many top philosophers, Quine thinks clearly about such things. 1) is the classical bivalent reading of excluded middle; 2) is the purely syntactic version; 3) leaves open how we interpret the 'not-true' option. |
| 10012 | Quantification theory can still be proved complete if we add identity [Quine] |
| Full Idea: Complete proof procedures are available not only for quantification theory, but for quantification theory and identity together. Gödel showed that the theory is still complete if we add self-identity and the indiscernability of identicals. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.5) | |
| A reaction: Hence one talks of first-order logic 'with identity', even though, as Quine observes, it is unclear whether identity is actually a logical or a mathematical notion. |
| 13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
| Full Idea: My doctrine is that the peculiarity of the logical constants resides precisely in that given a certain pure notion of truth and consequence, all the desirable semantic properties of the constants are determined by their syntactic properties. | |
| From: Ian Hacking (What is Logic? [1979], §09) | |
| A reaction: He opposes this to Peacocke 1976, who claims that the logical connectives are essentially semantic in character, concerned with the preservation of truth. |
| 13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
| Full Idea: For some purposes the variables of first-order logic can be regarded as prepositions and place-holders that could in principle be dispensed with, say by a system of arrows indicating what places fall in the scope of which quantifier. | |
| From: Ian Hacking (What is Logic? [1979], §11) | |
| A reaction: I tend to think of variables as either pronouns, or as definite descriptions, or as temporary names, but not as prepositions. Must address this new idea... |
| 9016 | Names are not essential, because naming can be turned into predication [Quine] |
| Full Idea: Names are convenient but redundant, because Fa is equivalent to (an x)(a=x,Fx), so a need only occur in the context a=, but this can be rendered as a simple predicate A, so that Fa gives way to (an x)(Ax.Fx). | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.2) | |
| A reaction: In eliminating names from analysis, Quine takes Russell's strategy a step further. It is probably this which provoked Kripke into going right back to Mill's view of names as basic labels. The name/description boundary is blurred. Mr Gradgrind. |
| 9015 | Universal quantification is widespread, but it is definable in terms of existential quantification [Quine] |
| Full Idea: Universal quantification is prominent in logical practice but superfluous in theory, since (for all x)Fx obviously amounts to not(exists an x)not-Fx. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.2) | |
| A reaction: The equivalence between these two works both ways, some you could take the universal quantifier as primitive instead, which would make general truths prior to particular ones. Is there something deep at stake here? |
| 9025 | You can't base quantification on substituting names for variables, if the irrationals cannot all be named [Quine] |
| Full Idea: A customary argument against quantification based on substitution of names for variables refers to the theorem of set theory that irrational numbers cannot all be assigned integers. Although the integers can all be named, the irrationals therefore can't. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.6) | |
| A reaction: [He names Ruth Marcus as a source of substitutional quantification] This sounds like more than a mere 'argument' against substitutional quantification, but an actual disproof. Or maybe you just can't quantify once you run out of names. |
| 9026 | Some quantifications could be false substitutionally and true objectually, because of nameless objects [Quine] |
| Full Idea: An existential quantification could turn out false when substitutionally construed and true when objectually construed, because of there being objects of the purported kind but only nameless ones. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.6) | |
| A reaction: (Cf. Idea 9025) Some irrational numbers were his candidates for nameless objects, but as decimals they are infinite in length which seems unfair. I don't take even pi or root-2 to be objects in nature, so not naming irrationals doesn't bother me. |
| 10705 | Putting a predicate letter in a quantifier is to make it the name of an entity [Quine] |
| Full Idea: To put the predicate letter 'F' in a quantifier is to treat predicate positions suddenly as name positions, and hence to treat predicates as names of entities of some sort. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.5) | |
| A reaction: Quine's famous objection to second-order logic. But Quine then struggles to give an account of predicates and properties, and hence is accused by Armstrong of being an 'ostrich'. Boolos 1975 also attacks Quine here. |
| 9027 | A sentence is logically true if all sentences with that grammatical structure are true [Quine] |
| Full Idea: A sentence is logically true if all sentences with that grammatical structure are true. | |
| From: Willard Quine (Philosophy of Logic [1970], Ch.7) | |
| A reaction: Quine spends some time on the tricky question of deciding which parts of a sentence are grammatical structure ('syncategorematic'), and which parts are what he calls 'lexicon'. I bet there is a Quinean argument which blurs the boundary. |
| 13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
| Full Idea: A Löwenheim-Skolem theorem holds for anything which, on my delineation, is a logic. | |
| From: Ian Hacking (What is Logic? [1979], §13) | |
| A reaction: I take this to be an unusually conservative view. Shapiro is the chap who can give you an alternative view of these things, or Boolos. |