Combining Texts

All the ideas for 'Science and Method', 'Modal Logics and Philosophy' and 'An Introduction to Modal Logic'

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


20 ideas

4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
Propositional logic handles negation, disjunction, conjunction; predicate logic adds quantifiers, predicates, relations [Girle]
There are three axiom schemas for propositional logic [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 / b. Terminology of PL
A 'value-assignment' (V) is when to each variable in the set V assigns either the value 1 or the value 0 [Hughes/Cresswell]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
The Law of Transposition says (P→Q) → (¬Q→¬P) [Hughes/Cresswell]
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 / B. Propositional Logic PL / 4. Soundness of PL
The rules preserve validity from the axioms, so no thesis negates any other thesis [Hughes/Cresswell]
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 / B. Logical Consequence / 7. Strict Implication
Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle]
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 / K. Features of Logics / 4. Completeness
A system is 'weakly' complete if all wffs are derivable, and 'strongly' if theses are maximised [Hughes/Cresswell]
6. Mathematics / A. Nature of Mathematics / 2. Geometry
One geometry cannot be more true than another [Poincaré]
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]