78 ideas
| 13689 | 'Theorems' are formulas provable from no premises at all [Sider] |
| 13705 | Truth tables assume truth functionality, and are just pictures of truth functions [Sider] |
| 13706 | Intuitively, deontic accessibility seems not to be reflexive, but to be serial [Sider] |
| 13710 | In D we add that 'what is necessary is possible'; then tautologies are possible, and contradictions not necessary [Sider] |
| 13711 | System B introduces iterated modalities [Sider] |
| 13708 | S5 is the strongest system, since it has the most valid formulas, because it is easy to be S5-valid [Sider] |
| 13712 | Epistemic accessibility is reflexive, and allows positive and negative introspection (KK and K¬K) [Sider] |
| 13714 | We can treat modal worlds as different times [Sider] |
| 13720 | Converse Barcan Formula: □∀αφ→∀α□φ [Sider] |
| 13718 | The Barcan Formula ∀x□Fx→□∀xFx may be a defect in modal logic [Sider] |
| 13723 | System B is needed to prove the Barcan Formula [Sider] |
| 13715 | You can employ intuitionist logic without intuitionism about mathematics [Sider] |
| 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] |
| 9687 | A 'member' of a set is one of the objects in the set [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] |
| 9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
| 13678 | The most popular account of logical consequence is the semantic or model-theoretic one [Sider] |
| 13679 | Maybe logical consequence is more a matter of provability than of truth-preservation [Sider] |
| 13682 | Maybe logical consequence is impossibility of the premises being true and the consequent false [Sider] |
| 13680 | Maybe logical consequence is a primitive notion [Sider] |
| 13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
| 13696 | When a variable is 'free' of the quantifier, the result seems incapable of truth or falsity [Sider] |
| 13700 | A 'total' function must always produce an output for a given domain [Sider] |
| 13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
| 13688 | Good axioms should be indisputable logical truths [Sider] |
| 13687 | No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider] |
| 13690 | Proof by induction 'on the length of the formula' deconstructs a formula into its accepted atoms [Sider] |
| 13691 | Induction has a 'base case', then an 'inductive hypothesis', and then the 'inductive step' [Sider] |
| 13685 | Natural deduction helpfully allows reasoning with assumptions [Sider] |
| 13686 | We can build proofs just from conclusions, rather than from plain formulae [Sider] |
| 13697 | Valuations in PC assign truth values to formulas relative to variable assignments [Sider] |
| 13684 | The semantical notion of a logical truth is validity, being true in all interpretations [Sider] |
| 13704 | It is hard to say which are the logical truths in modal logic, especially for iterated modal operators [Sider] |
| 13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
| 13698 | In a complete logic you can avoid axiomatic proofs, by using models to show consequences [Sider] |
| 13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 13692 | A 'precisification' of a trivalent interpretation reduces it to a bivalent interpretation [Sider] |
| 13695 | Supervaluational logic is classical, except when it adds the 'Definitely' operator [Sider] |
| 13693 | A 'supervaluation' assigns further Ts and Fs, if they have been assigned in every precisification [Sider] |
| 13694 | We can 'sharpen' vague terms, and then define truth as true-on-all-sharpenings [Sider] |
| 13683 | A relation is a feature of multiple objects taken together [Sider] |
| 13702 | The identity of indiscernibles is necessarily true, if being a member of some set counts as a property [Sider] |
| 13721 | 'Strong' necessity in all possible worlds; 'weak' necessity in the worlds where the relevant objects exist [Sider] |
| 13707 | Maybe metaphysical accessibility is intransitive, if a world in which I am a frog is impossible [Sider] |
| 13709 | Logical truths must be necessary if anything is [Sider] |
| 13716 | 'If B hadn't shot L someone else would have' if false; 'If B didn't shoot L, someone else did' is true [Sider] |
| 13717 | Transworld identity is not a problem in de dicto sentences, which needn't identify an individual [Sider] |
| 13719 | Barcan Formula problem: there might have been a ghost, despite nothing existing which could be a ghost [Sider] |
| 12608 | Concepts are distinguished by roles in judgement, and are thus tied to rationality [Peacocke] |
| 12605 | A sense is individuated by the conditions for reference [Peacocke] |
| 12607 | Fregean concepts have their essence fixed by reference-conditions [Peacocke] |
| 12609 | Concepts have distinctive reasons and norms [Peacocke] |
| 12604 | Any explanation of a concept must involve reference and truth [Peacocke] |
| 12610 | Encountering novel sentences shows conclusively that meaning must be compositional [Peacocke] |