23 ideas
| 19066 | Philosophy aims to understand the world, through ordinary experience and science [Dummett] |
| Full Idea: Philosophy is an attempt to understand the world, as it is revealed to us both in our ordinary experience and by the discoveries and theories of science. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.311) | |
| A reaction: I don't see a sharp division between 'ordinary' and 'scientific'. I really like this idea, first because it makes 'understanding' central, and second because it wants both revelations. In discussing matter and time, there is too much emphasis on science. |
| 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. |
| 19067 | A successful proof requires recognition of truth at every step [Dummett] |
| Full Idea: For a demonstration to be cogent it is necessary that the passage from step to step involve a recognition of truth at each line. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.313) | |
| A reaction: Dummett cited Quine (esp. 1970) as having an almost entirely syntactic view of logic. Rumfitt points out that logic can move validly from one falsehood to another. Even a 'proof' might detour into falsehood, but it would not be a 'canonical' proof! |
| 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) |
| 19060 | Truth-tables are dubious in some cases, and may be a bad way to explain connective meaning [Dummett] |
| Full Idea: It is arguable whether two-valued truth tables give correct meanings for certain sentential operators, and even whether they constitute legitimate explanations of any possible sentential operators. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.294) | |
| A reaction: See 'Many-valued logic' for examples of non-binary truth tables. Presumably logicians should aspire to make their semantics precise, as well as their syntax. |
| 11066 | Deduction is justified by the semantics of its metalanguage [Dummett, by Hanna] |
| Full Idea: For Dummett the semantics of the metalanguage is the external and objective source of the justification of deduction. | |
| From: report of Michael Dummett (The Justification of Deduction [1973]) by Robert Hanna - Rationality and Logic 3.4 | |
| A reaction: This is offered as an answer to the Lewis Carroll problem that justifying deduction seems to need deduction, thus leading to a regress. [There is a reply to Dummett by Susan Haack] |
| 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) |
| 19058 | Syntactic consequence is positive, for validity; semantic version is negative, with counterexamples [Dummett] |
| Full Idea: A plausible account is that the syntactic notion of consequence is for positive results, that some form of argument is valid; the semantic notion is required for negative results, that some argument is invalid, because a counterexample can be found. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.292) | |
| A reaction: This rings true for the two strategies of demonstration, the first by following the rules in steps, the second by using your imagination (or a tableau) to think up problems. |
| 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... |
| 19063 | Beth trees show semantics for intuitionistic logic, in terms of how truth has been established [Dummett] |
| Full Idea: Beth trees give a semantics for intuitionistic logic, by representing sentence meaning in terms of conditions under which it is recognised to have been established as true. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.305) |
| 19059 | In standard views you could replace 'true' and 'false' with mere 0 and 1 [Dummett] |
| Full Idea: Nothing is lost, on this view, if in the standard semantic treatment of classical sentential logic, we replace the standard truth-values 'true' and 'false' by the numbers 0 and 1. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.294) | |
| A reaction: [A long context will explain 'on this view'] He is discussing the relationship of syntactic and semantic consequence, and goes on to criticise simple binary truth-table accounts of connectives. Semantics on a computer would just be 0 and 1. |
| 19062 | Classical two-valued semantics implies that meaning is grasped through truth-conditions [Dummett] |
| Full Idea: The standard two-valued semantics for classical logic involves a conception under which to grasp the meaning of a sentence is to apprehend the conditions under which it is, or is not, true. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.305) | |
| A reaction: The idea is that you only have to grasp the truth tables for sentential logic, and that needs nothing more than knowing whether a sentence is true or false. I'm not sure where the 'conditions' creep in, though. |
| 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. |
| 19065 | Soundness and completeness proofs test the theory of meaning, rather than the logic theory [Dummett] |
| Full Idea: A proof of soundess or completeness is a test, not so much of the logical theory to which it applies, but of the theory of meaning which underlies the semantics. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.310) | |
| A reaction: These two types of proof concern how the syntax and the semantics match up, so this claim sounds plausible, though I tend to think of them as more like roadworthiness tests for logic, checking how well they function. |
| 19061 | An explanation is often a deduction, but that may well beg the question [Dummett] |
| Full Idea: An explanation is often a deductive argument, with the fact needing explaining as its conclusion. ...But the conclusion is usually given in advance, and we may only believe the premisses because they plausibly explain the conclusion. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.296) | |
| A reaction: [compressed (Dummett's wordy prose cries out for it!)] I suppose this works better in mathematics, which is central to Dummett's interests. In the real world the puzzle is not usually logically implied by its explanation. |
| 19064 | Holism is not a theory of meaning; it is the denial that a theory of meaning is possible [Dummett] |
| Full Idea: In the sense of giving a model for the content of a sentence, its representative power, holism is not a theory of meaning; it is the denial that a theory of meaning is possible. | |
| From: Michael Dummett (The Justification of Deduction [1973], p.309) | |
| A reaction: This will obviously be because sentences just don't have meaning in isolation, so their meaning can't be given in terms of the sentences. |
| 468 | Musical performance can reveal a range of virtues [Damon of Ath.] |
| Full Idea: In singing and playing the lyre, a boy will be likely to reveal not only courage and moderation, but also justice. | |
| From: Damon (fragments/reports [c.460 BCE], B4), quoted by (who?) - where? |