82 ideas
9123 | Someone standing in a doorway seems to be both in and not-in the room [Priest,G, by Sorensen] |
9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
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] |
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] |
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] |
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] |
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] |
9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
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] |
9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
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] |
13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
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] |
8720 | A logic is 'relevant' if premise and conclusion are connected, and 'paraconsistent' allows contradictions [Priest,G, by Friend] |
9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
9697 | X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G] |
9685 | <a,b&62; is a set whose members occur in the order shown [Priest,G] |
9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G] |
9674 | {x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G] |
9673 | {a1, a2, ...an} indicates that a set comprising just those objects [Priest,G] |
9677 | Φ indicates the empty set, which has no members [Priest,G] |
9676 | {a} is the 'singleton' set of a (not the object a itself) [Priest,G] |
9679 | X⊂Y means set X is a 'proper subset' of set Y [Priest,G] |
9678 | X⊆Y means set X is a 'subset' of set Y [Priest,G] |
9681 | X = Y means the set X equals the set Y [Priest,G] |
9683 | X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G] |
9682 | X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G] |
9684 | Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G] |
9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G] |
9695 | An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G] |
9696 | A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G] |
9686 | A 'set' is a collection of objects [Priest,G] |
9689 | The 'empty set' or 'null set' has no members [Priest,G] |
9690 | A set is a 'subset' of another set if all of its members are in that set [Priest,G] |
9691 | A 'proper subset' is smaller than the containing set [Priest,G] |
9688 | A 'singleton' is a set with only one member [Priest,G] |
9687 | A 'member' of a set is one of the objects in the set [Priest,G] |
9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
13373 | Typically, paradoxes are dealt with by dividing them into two groups, but the division is wrong [Priest,G] |
13368 | The 'least indefinable ordinal' is defined by that very phrase [Priest,G] |
13370 | 'x is a natural number definable in less than 19 words' leads to contradiction [Priest,G] |
13369 | By diagonalization we can define a real number that isn't in the definable set of reals [Priest,G] |
13366 | The least ordinal greater than the set of all ordinals is both one of them and not one of them [Priest,G] |
13367 | The next set up in the hierarchy of sets seems to be both a member and not a member of it [Priest,G] |
13371 | If you know that a sentence is not one of the known sentences, you know its truth [Priest,G] |
13372 | There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G] |
13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
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] |
13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
1743 | The greatest deterrence for injustice is if uninjured parties feel as much indignation as those who are injured [Solon, by Diog. Laertius] |