Combining Texts

All the ideas for '', 'On Anger (Book 3)' and 'What is Logic?'

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 / 1. Overview of Logic
If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt]
     Full Idea: If a designated conclusion follows from the premisses, but the argument involves two howlers which cancel each other out, then the moral is that the path an argument takes from premisses to conclusion does matter to its logical evaluation.
     From: Ian Rumfitt ("Yes" and "No" [2000], II)
     A reaction: The drift of this is that our view of logic should be a little closer to the reasoning of ordinary language, and we should rely a little less on purely formal accounts.
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
Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt]
     Full Idea: If 'and' and 'but' really are alike in sense, in what might that likeness consist? Some philosophers of classical logic will reply that they share a sense by virtue of sharing a truth table.
     From: Ian Rumfitt ("Yes" and "No" [2000])
     A reaction: This is the standard view which Rumfitt sets out to challenge.
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.
The sense of a connective comes from primitively obvious rules of inference [Rumfitt]
     Full Idea: A connective will possess the sense that it has by virtue of its competent users' finding certain rules of inference involving it to be primitively obvious.
     From: Ian Rumfitt ("Yes" and "No" [2000], III)
     A reaction: Rumfitt cites Peacocke as endorsing this view, which characterises the logical connectives by their rules of usage rather than by their pure semantic value.
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.
19. Language / F. Communication / 3. Denial
We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt]
     Full Idea: The standard view is that affirming not-A is more complex than affirming the atomic sentence A itself, with the latter determining its sense. But we could learn 'not' directly, by learning at once how to either affirm A or reject A.
     From: Ian Rumfitt ("Yes" and "No" [2000], IV)
     A reaction: [compressed] This seems fairly anti-Fregean in spirit, because it looks at the psychology of how we learn 'not' as a way of clarifying what we mean by it, rather than just looking at its logical behaviour (and thus giving it a secondary role).
23. Ethics / C. Virtue Theory / 2. Elements of Virtue Theory / e. Character
True greatness is never allowing events to disturb you [Seneca]
     Full Idea: There is no more reliable proof of greatness than to be in a state where nothing can happen to make you disturbed.
     From: Seneca the Younger (On Anger (Book 3) [c.60], §06)
     A reaction: He specifically opposes Aristotle's view that there are times when anger is appropriate, and failure to be very angry indeed is a failure of character.
23. Ethics / C. Virtue Theory / 3. Virtues / a. Virtues
Every night I critically review how I have behaved during the day [Seneca]
     Full Idea: When the lamp has been removed from my sight, and my wife, no stranger now to my habit, has fallen silent, I examine the whole of my day and retrace my actions and words; I hide nothing from myself.
     From: Seneca the Younger (On Anger (Book 3) [c.60], §36)
23. Ethics / C. Virtue Theory / 3. Virtues / b. Temperance
Anger is a vice which afflicts good men as well as bad [Seneca]
     Full Idea: Other vile passions affect only the worst sort of men, but anger creeps up even on enlightened me who are otherwise sane.
     From: Seneca the Younger (On Anger (Book 3) [c.60], §04)
     A reaction: A very interesting observation for anyone who is trying to analyse the key issues in virtue theory.
Anger is an extreme vice, threatening sanity, and gripping whole states [Seneca]
     Full Idea: Other vices drive the mind on, anger hurls it headlong; ..other vices revolt from good sense, this one from sanity; ...other vices seize individuals, this is the one passion that sometimes takes hold of an entire state.
     From: Seneca the Younger (On Anger (Book 3) [c.60], §01)
     A reaction: He particularly dislikes anger because it is the vice that leads to violence.