Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'Some Models for Implicature' and 'Conditionals'

unexpand these ideas     |    start again     |     specify just one area for these texts


19 ideas

2. Reason / D. Definition / 3. Types of Definition
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.
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
'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.
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).
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)
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
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?
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
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)
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.
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
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)
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
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.
5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic
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...
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
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.
10. Modality / B. Possibility / 8. Conditionals / a. Conditionals
Validity can preserve certainty in mathematics, but conditionals about contingents are another matter [Edgington]
     Full Idea: If your interest in logic is confined to applications to mathematics or other a priori matters, it is fine for validity to preserve certainty, ..but if you use conditionals when arguing about contingent matters, then great caution will be required.
     From: Dorothy Edgington (Conditionals [2001], 17.2.1)
10. Modality / B. Possibility / 8. Conditionals / b. Types of conditional
There are many different conditional mental states, and different conditional speech acts [Edgington]
     Full Idea: As well as conditional beliefs, there are conditional desires, hopes, fears etc. As well as conditional statements, there are conditional commands, questions, offers, promises, bets etc.
     From: Dorothy Edgington (Conditionals [2001], 17.3.4)
10. Modality / B. Possibility / 8. Conditionals / c. Truth-function conditionals
Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? [Edgington]
     Full Idea: Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? Are they non-truth-functional, like 'because' or 'before'? Do the values of A and B, in some cases, leave open the value of 'If A,B'?
     From: Dorothy Edgington (Conditionals [2001], 17.1)
     A reaction: I would say they are not truth-functional, because the 'if' asserts some further dependency relation that goes beyond the truth or falsity of A and B. Logical ifs, causal ifs, psychological ifs... The material conditional ⊃ is truth-functional.
'If A,B' must entail ¬(A & ¬B); otherwise we could have A true, B false, and If A,B true, invalidating modus ponens [Edgington]
     Full Idea: If it were possible to have A true, B false, and If A,B true, it would be unsafe to infer B from A and If A,B: modus ponens would thus be invalid. Hence 'If A,B' must entail ¬(A & ¬B).
     From: Dorothy Edgington (Conditionals [2001], 17.1)
     A reaction: This is a firm defence of part of the truth-functional view of conditionals, and seems unassailable. The other parts of the truth table are open to question, though, if A is false, or they are both true.
19. Language / A. Nature of Meaning / 6. Meaning as Use
Grice said patterns of use are often semantically irrelevant, because it is a pragmatic matter [Grice, by Glock]
     Full Idea: The slogan that meaning is use came under scrutiny by Grice's theory of conversational implicature. He said patterns of use shown in analysis were often semantically irrelevant, snce they are due not meanings of expressions but to pragmatic principles.
     From: report of H. Paul Grice (Some Models for Implicature [1967]) by Hans-Johann Glock - What is Analytic Philosophy? 2.8
     A reaction: I think the simplest objection is that words only have use because they have a meaning; The most interesting part of pragmatics is what you DON'T say in conversation.
19. Language / F. Communication / 5. Pragmatics / b. Implicature
Grice's maxim of quality says do not assert what you believe to be false [Grice, by Magidor]
     Full Idea: Grice's maxim of quality says one ought not to assert what one believes to be false.
     From: report of H. Paul Grice (Some Models for Implicature [1967]) by Ofra Magidor - Category Mistakes 5.2
     A reaction: The obvious exception is irony, where are truth is asserted, but the listener is supposed to spot that you are not really asserting it.
Grice's maxim of quantity says be sufficiently informative [Grice, by Magidor]
     Full Idea: Grice's maxim of quantity says 'make your contributions as informative as required'.
     From: report of H. Paul Grice (Some Models for Implicature [1967]) by Ofra Magidor - Category Mistakes 5.2
     A reaction: Is the 'requirement' of informative for the speaker or for the listener? It is easy to image situations where, one way or the other, the two people don't agree about informativenss.
Grice's maxim of manner requires one to be as brief as possible [Grice, by Magidor]
     Full Idea: Grice's maxim of manner requires one to be as brief as possible.
     From: report of H. Paul Grice (Some Models for Implicature [1967]) by Ofra Magidor - Category Mistakes 5.2
     A reaction: An alternative maxim of conversation is that there should not be long silences between contributions - which would probably result if the contributions are all curtly abbreviated.