Combining Texts

All the ideas for 'fragments/reports', 'First-Order Modal Logic' and 'Logicism and Ontological Commits. of Arithmetic'

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

57 ideas

2. Reason / C. Styles of Reason / 1. Dialectic
20768 Like spiderswebs, dialectical arguments are clever but useless [Ariston, by Diog. Laertius]
3. Truth / F. Semantic Truth / 2. Semantic Truth
10017 Truth in a model is more tractable than the general notion of truth [Hodes]
10018 Truth is quite different in interpreted set theory and in the skeleton of its language [Hodes]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
9738 Each line of a truth table is a model [Fitting/Mendelsohn]
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
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]
13727 A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [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
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]
13138 Disj: 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]
13142 Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn]
13141 Negation: if σ ¬¬X then σ 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]
13139 Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn]
13144 T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn]
13148 4r rev-trans: 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]
13146 B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn]
13145 D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn]
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]
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
13111 Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn]
13112 In epistemic logic knowers are logically omniscient, so they know that they know [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
13729 The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn]
13728 The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
10015 Higher-order logic may be unintelligible, but it isn't set theory [Hodes]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
10011 Identity is a level one relation with a second-order definition [Hodes]
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 / I. Semantics of Logic / 1. Semantics of Logic
10016 When an 'interpretation' creates a model based on truth, this doesn't include Fregean 'sense' [Hodes]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / a. Numbers
10027 Mathematics is higher-order modal logic [Hodes]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / f. Arithmetic
10026 Arithmetic must allow for the possibility of only a finite total of objects [Hodes]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
10021 It is claimed that numbers are objects which essentially represent cardinality quantifiers [Hodes]
10022 Numerical terms can't really stand for quantifiers, because that would make them first-level [Hodes]
7. Existence / D. Theories of Reality / 7. Fictionalism
10023 Talk of mirror images is 'encoded fictions' about real facts [Hodes]
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 / 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]
23. Ethics / C. Virtue Theory / 2. Elements of Virtue Theory / f. The Mean
3049 The chief good is indifference to what lies midway between virtue and vice [Ariston, by Diog. Laertius]
23. Ethics / D. Deontological Ethics / 1. Deontology
3549 Ariston says rules are useless for the virtuous and the non-virtuous [Ariston, by Annas]