20 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. |
| 6396 | A sentence is held true because of a combination of meaning and belief [Davidson] |
| Full Idea: A sentence is held true because of two factors: what the holder takes the sentence to mean, and what he believes. | |
| From: Donald Davidson (Thought and Talk [1975], p.20) | |
| A reaction: A key question is whether a belief (e.g. an imagistic one, or one held by an animal) could be true, even though no sentence is involved. Linguistic philosophers tend to avoid this question, or assume the answer is 'no'. |
| 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) |
| 21717 | Reducibility undermines type ramification, and is committed to the existence of functions [Quine, by Linsky,B] |
| Full Idea: Quine charges that the axiom of Reducibility both undoes the effect of the ramification, and commits the theory to a platonist view of propositional functions (which is a theory of sets, once use/mention confusions are cleared up). | |
| From: report of Willard Quine (Set Theory and its Logic [1963], p.249-58) by Bernard Linsky - Russell's Metaphysical Logic 6.1 |
| 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. |
| 11145 | Having a belief involves the possibility of being mistaken [Davidson] |
| Full Idea: Someone cannot have a belief unless he understands the possibility of being mistaken. | |
| From: Donald Davidson (Thought and Talk [1975], p.170) | |
| A reaction: If you pretend to throw a ball for a dog, but don't release it, the dog experiences being mistaken very dramatically. |
| 6397 | The concept of belief can only derive from relationship to a speech community [Davidson] |
| Full Idea: We have the idea of belief from its role in the interpretation of language; as a private attitude it is not intelligible except in relation to public language. So a creature must be a member of a speech community to have the concept of belief. | |
| From: Donald Davidson (Thought and Talk [1975], p.22) | |
| A reaction: This shows how Wittgenstein's Private Language Argument (e.g. Idea 4152) hovers behind Davidson's philosophy. The idea is quite persuasive. A solitary creature just follows its mental states. The question of whether it believes them is a meta-thought. |
| 6392 | Thought depends on speech [Davidson] |
| Full Idea: The thesis I want to refine and then argue for is that thought depends on speech. | |
| From: Donald Davidson (Thought and Talk [1975], p.8) | |
| A reaction: This has the instant and rather implausible implication that animals don't think. He is not, of course, saying that all thought is speech, which would leave out thinking in images. You can't do much proper thought without concepts and propositions. |
| 6393 | A creature doesn't think unless it interprets another's speech [Davidson] |
| Full Idea: A creature cannot have a thought unless it is an interpreter of the speech of another. | |
| From: Donald Davidson (Thought and Talk [1975], p.9) | |
| A reaction: His use of the word 'creature' shows that he is perfectly aware of the issue of whether animals think, and he is, presumably, denying it. At first glance this sounds silly, but maybe animals don't really 'think', in our sense of the word. |
| 11144 | Concepts are only possible in a language community [Davidson] |
| Full Idea: A private attitude is not intelligible except as an adjustment to the public norms provided by language. It follows that a creature must be a member of speech community if it is to have the concept of belief. | |
| From: Donald Davidson (Thought and Talk [1975], p.170) | |
| A reaction: This obviously draws on Wittgenstein's private language argument, and strikes me as blatantly wrong, because I take higher animals to have concepts without language. Pure vision gives rise to concepts. I don't even think they are necessarily conscious. |
| 6395 | An understood sentence can be used for almost anything; it isn't language if it has only one use [Davidson] |
| Full Idea: Once a sentence is understood, an utterance of it may be used to serve almost any extra-linguistic purpose; an instrument that could be put to only one use would lack autonomy of meaning, which means it should not be counted as language. | |
| From: Donald Davidson (Thought and Talk [1975], p.17) | |
| A reaction: I find this point very appealing, in opposition to the Wittgenstein view of meaning as use. Passwords seem to me a striking case of the separation of meaning and use. I like the phrase 'autonomy of meaning'. Random sticks can form a word. |
| 6394 | The pattern of sentences held true gives sentences their meaning [Davidson] |
| Full Idea: Although most utterances are not concerned with truth, it is the pattern of sentences held true that gives sentences their meaning. | |
| From: Donald Davidson (Thought and Talk [1975], p.14) | |
| A reaction: Davidson's distinctive version of meaning holism, as opposed to Quine's rather behaviouristic version. I agree that we relate to people through the pattern of sentences they hold true, but I am unconvinced that this 'gives sentences their meaning'. |