16 ideas
| 13838 | A decent modern definition should always imply a semantics [Hacking] |
| Full Idea: Today we expect that anything worth calling a definition should imply a semantics. | |
| From: Ian Hacking (What is Logic? [1979], §10) | |
| A reaction: He compares this with Gentzen 1935, who was attempting purely syntactic definitions of the logical connectives. |
| 13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
| Full Idea: 'Dilution' (or 'Thinning') provides an essential contrast between deductive and inductive reasoning; for the introduction of new premises may spoil an inductive inference. | |
| From: Ian Hacking (What is Logic? [1979], §06.2) | |
| A reaction: That is, inductive logic (if there is such a thing) is clearly non-monotonic, whereas classical inductive logic is monotonic. |
| 13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
| Full Idea: If A |- B and B |- C, then A |- C. This generalises to: If Γ|-A,Θ and Γ,A |- Θ, then Γ |- Θ. Gentzen called this 'cut'. It is the transitivity of a deduction. | |
| From: Ian Hacking (What is Logic? [1979], §06.3) | |
| A reaction: I read the generalisation as 'If A can be either a premise or a conclusion, you can bypass it'. The first version is just transitivity (which by-passes the middle step). |
| 13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
| Full Idea: Only the cut rule can have a conclusion that is less complex than its premises. Hence when cut is not used, a derivation is quite literally constructive, building up from components. Any theorem obtained by cut can be obtained without it. | |
| From: Ian Hacking (What is Logic? [1979], §08) |
| 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) |
| 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... |
| 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. |
| 15538 | Semantic indecision explains vagueness (if we have precisifications to be undecided about) [Lewis] |
| Full Idea: Semantic indecision will suffice to explain the phenomenon of vagueness. [note] Provided that there exist the many precisifications for us to be undecided between. If you deny this, you will indeed have need of vague objects. | |
| From: David Lewis (Many, but almost one [1993], 'Two solutions') | |
| A reaction: [He mentions Van Inwagen 1990:213-83] There seem to be three solutions to vague objects: that they really are vague, that they are precise but we can't know precisely, or Lewis's view. I like Lewis's view. Do animals have any problem with vagueness? |
| 15537 | If cats are vague, we deny that the many cats are one, or deny that the one cat is many [Lewis] |
| Full Idea: To deny that there are many cats on the mat (because removal of a few hairs seems to produce a new one), we must either deny that the many are cats, or else deny that the cats are many. ...I think both alternatives lead to successful solutions. | |
| From: David Lewis (Many, but almost one [1993], 'The paradox') | |
| A reaction: He credits the problem to Geach (and Tibbles), and says it is the same as Unger's 'problem of the many' (Idea 15536). |
| 15536 | We have one cloud, but many possible boundaries and aggregates for it [Lewis] |
| Full Idea: Many surfaces are equally good candidates to be boundaries of a cloud; therefore many aggregates of droplets are equally good candidates to be the cloud. How is it that we have just one cloud? And yet we do. This is Unger's (1980) 'problem of the many'. | |
| From: David Lewis (Many, but almost one [1993], 'The problem') | |
| A reaction: This is the problem of vague objects, as opposed to the problem of vague predicates, or the problem of vague truths, or the problem of vague prepositions (like 'towards'). |
| 15539 | Basic to pragmatics is taking a message in a way that makes sense of it [Lewis] |
| Full Idea: The cardinal principle of pragmatics is that the right way to take what is said, if at all possible, is the way that makes sense of the message. | |
| From: David Lewis (Many, but almost one [1993], 'A better solution') | |
| A reaction: Thus when someone misuses a word, suggesting nonsense, we gloss over it, often without even mentioning it, because the underlying sense is obvious. A good argument for the existence of propositions. Lewis doesn't mention truth. |
| 7482 | Resurrection developed in Judaism as a response to martyrdoms, in about 160 BCE [Anon (Dan), by Watson] |
| Full Idea: The idea of resurrection in Judaism seems to have first developed around 160 BCE, during the time of religious martyrdom, and as a response to it (the martyrs were surely not dying forever?). It is first mentioned in the book of Daniel. | |
| From: report of Anon (Dan) (27: Book of Daniel [c.165 BCE], Ch.7) by Peter Watson - Ideas | |
| A reaction: Idea 7473 suggests that Zoroaster beat them to it by 800 years. |