83 ideas
9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
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] |
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] |
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] |
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] |
9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton] |
13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
9701 | A 'relation' is a set of ordered pairs [Enderton] |
9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
13203 | The singleton is defined using the pairing axiom (as {x,x}) [Enderton] |
9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
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] |
5467 | Euler said nature is instrinsically passive, and minds cause change [Euler, by Ellis] |