15 ideas
| 21546 | We can't sharply distinguish variables, domains and values, if symbols frighten us [Russell] |
| Full Idea: Whoever is afraid of symbols can hardly hope to acquire exact ideas where it is necessary to distinguish 1) the variable in itself as opposed to its value, 2) any value of the variable, 3) all values, 4) some value. | |
| From: Bertrand Russell (Review: Meinong 'Untersuchungen zur..' [1905], p.84) | |
| A reaction: Not the best example, perhaps, of the need for precision, but a nice illustration of the new attitude Russell brought into philosophy. |
| 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. |
| 21531 | Common sense agrees with Meinong (rather than Russell) that 'Pegasus is a flying horse' is true [Lackey on Russell] |
| Full Idea: Meinong's theory says that 'Pegasus is a flying horse' is true, while Russell's says that this assertion is false. The average man, if he knows his mythology, would probably agree with Meinong. | |
| From: comment on Bertrand Russell (Review: Meinong 'Untersuchungen zur..' [1905]) by Douglas Lackey - Intros to Russell's 'Essays in Analysis' p.19 | |
| A reaction: It seems obvious that some disambiguation is needed here. Assenting to that assertion would be blatantly contextual. No one backs Pegasus at a race track. |
| 21545 | I prefer to deny round squares, and deal with the difficulties by the theory of denoting [Russell] |
| Full Idea: I should prefer to say that there is no such object as 'the round square'. The difficulties of excluding such objects can, I think, be avoided by the theory of denoting. | |
| From: Bertrand Russell (Review: Meinong 'Untersuchungen zur..' [1905], p.81) | |
| A reaction: The 'theory of denoting' is his brand new theory of definite descriptions, which makes implicit claims of existence explicit, so that they can be judged. Why can't we just say that a round square can be an intentional object, but not a real object? |
| 5954 | All inventions of the mind aim at pleasure, and those that don't are worthless [Metrodorus of Lamp., by Plutarch] |
| Full Idea: Metrodorus says that all the wonderful, ingenious and brilliant inventions of the mind have been contrived for the sake of pleasure of the flesh or for the sake of looking forward to it, and any accomplishment not leading to this end is worthless. | |
| From: report of Metrodorus (Lamp) (fragments/reports [c.291 BCE], Fr 6) by Plutarch - 74: Reply to Colotes §1125 | |
| A reaction: It is very hard to think of counterexamples! Would anyone bother to work out the theorems of number theory if they didn't enjoy doing it? Would any sensible person make great sacrifices if they didn't think that increased happiness would result? |