display all the ideas for this combination of texts
11 ideas
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. |
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. |
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... |
5740 | Second-order logic needs second-order variables and quantification into predicate position [Melia] |
Full Idea: Permitting quantification into predicate position and adding second-order variables leads to second-order logic. | |
From: Joseph Melia (Modality [2003], Ch.2) | |
A reaction: Often expressed by saying that we now quantify over predicates and relations, rather than just objects. Depends on your metaphysical commitments. |
5741 | If every model that makes premises true also makes conclusion true, the argument is valid [Melia] |
Full Idea: In first-order predicate calculus validity is defined thus: an argument is valid iff every model that makes the premises of the argument true also makes the conclusion of the argument true. | |
From: Joseph Melia (Modality [2003], Ch.2) | |
A reaction: See Melia Ch. 2 for an explanation of a 'model'. Traditional views of validity tend to say that if the premises are true the conclusion has to be true (necessarily), but this introduces the modal term 'necessarily', which is controversial. |
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. |