Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'The Discourses' and 'Philosophical Logic: Intro to Advanced Topics'

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


21 ideas

2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
4. Formal Logic / A. Syllogistic Logic / 1. Aristotelian Logic
The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward]
Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward]
4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward]
4. Formal Logic / A. Syllogistic Logic / 3. Term Logic
Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward]
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]
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
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]
In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward]
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]
A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward]
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]
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]
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]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward]
25. Social Practice / E. Policies / 2. Religion in Society
All legislators invoke God in support of extraordinary laws, because their justification is not obvious [Machiavelli]
Rulers should preserve the foundations of religion, to ensure good behaviour and unity [Machiavelli]