Combining Texts

All the ideas for 'The Evolution of Modern Metaphysics', 'First-Order Modal Logic' and 'Introduction to Mathematical Logic'

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

65 ideas

1. Philosophy / E. Nature of Metaphysics / 1. Nature of Metaphysics
21959 Metaphysics is the most general attempt to make sense of things [Moore,AW]
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
17749 Post proved the consistency of propositional logic in 1921 [Walicki]
17765 Propositional language can only relate statements as the same or as different [Walicki]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
9738 Each line of a truth table is a model [Fitting/Mendelsohn]
17764 Boolean connectives are interpreted as functions on the set {1,0} [Walicki]
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / a. Symbols of ML
9727 Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn]
9726 We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn]
9737 The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn]
13136 The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / b. Terminology of ML
13727 A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn]
9734 Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn]
9736 A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn]
9735 A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn]
9741 Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / c. Derivation rules of ML
13149 S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn]
9740 If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn]
9739 If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn]
13137 Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn]
13140 Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn]
13139 Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn]
13143 Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn]
13141 Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn]
13138 Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn]
13142 Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn]
13144 T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn]
13145 D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn]
13146 B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn]
13147 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn]
13148 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / b. System K
9742 The system K has no accessibility conditions [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / c. System D
13114 □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn]
9743 The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / d. System T
9744 The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / e. System K4
9746 The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / f. System B
9745 The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / g. System S4
9747 The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
9748 System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
9404 Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 5. Epistemic Logic
13112 In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn]
13111 Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 6. Temporal Logic
13113 F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 7. Barcan Formula
13728 The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn]
13729 The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
17752 The empty set is useful for defining sets by properties, when the members are not yet known [Walicki]
17753 The empty set avoids having to take special precautions in case members vanish [Walicki]
4. Formal Logic / F. Set Theory ST / 6. Ordering in Sets
17759 Ordinals play the central role in set theory, providing the model of well-ordering [Walicki]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
17741 To determine the patterns in logic, one must identify its 'building blocks' [Walicki]
5. Theory of Logic / F. Referring in Logic / 3. Property (λ-) Abstraction
9725 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
17747 A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
17748 The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
17761 A compact axiomatisation makes it possible to understand a field as a whole [Walicki]
17763 Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
17758 Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki]
17755 Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki]
17756 The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki]
17760 Two infinite ordinals can represent a single infinite cardinal [Walicki]
17757 Members of ordinals are ordinals, and also subsets of ordinals [Walicki]
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
17762 In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
17754 Inductive proof depends on the choice of the ordering [Walicki]
9. Objects / F. Identity among Objects / 7. Indiscernible Objects
13730 The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn]
10. Modality / A. Necessity / 2. Nature of Necessity
17742 Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki]
10. Modality / E. Possible worlds / 3. Transworld Objects / a. Transworld identity
13725 □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn]
13731 Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn]
10. Modality / E. Possible worlds / 3. Transworld Objects / c. Counterparts
13726 Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn]
11. Knowledge Aims / C. Knowing Reality / 3. Idealism / b. Transcendental idealism
21958 Appearances are nothing beyond representations, which is transcendental ideality [Moore,AW]