Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', '27: Book of Daniel' and 'Modal Logics and Philosophy'

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


27 ideas

2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
There are three axiom schemas for propositional logic [Girle]
Propositional logic handles negation, disjunction, conjunction; predicate logic adds quantifiers, predicates, relations [Girle]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / a. Symbols of PL
Proposition logic has definitions for its three operators: or, and, and identical [Girle]
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]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
Axiom systems of logic contain axioms, inference rules, and definitions of proof and theorems [Girle]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / g. System S4
There are seven modalities in S4, each with its negation [Girle]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
◊p → □◊p is the hallmark of S5 [Girle]
S5 has just six modalities, and all strings can be reduced to those [Girle]
4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
Possible worlds logics use true-in-a-world rather than true [Girle]
Modal logics were studied in terms of axioms, but now possible worlds semantics is added [Girle]
Modal logic has four basic modal negation equivalences [Girle]
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]
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 / 7. Second-Order Logic
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
5. Theory of Logic / B. Logical Consequence / 7. Strict Implication
Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle]
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 / H. Proof Systems / 5. Tableau Proof
If an argument is invalid, a truth tree will indicate a counter-example [Girle]
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]
10. Modality / A. Necessity / 3. Types of Necessity
Analytic truths are divided into logically and conceptually necessary [Girle]
10. Modality / B. Possibility / 1. Possibility
Possibilities can be logical, theoretical, physical, economic or human [Girle]
10. Modality / E. Possible worlds / 1. Possible Worlds / a. Possible worlds
A world has 'access' to a world it generates, which is important in possible worlds semantics [Girle]
29. Religion / D. Religious Issues / 2. Immortality / a. Immortality
Resurrection developed in Judaism as a response to martyrdoms, in about 160 BCE [Anon (Dan), by Watson]