38 ideas
| 7786 | Propositional logic handles negation, disjunction, conjunction; predicate logic adds quantifiers, predicates, relations [Girle] |
| 7798 | There are three axiom schemas for propositional logic [Girle] |
| 7799 | Proposition logic has definitions for its three operators: or, and, and identical [Girle] |
| 7797 | Axiom systems of logic contain axioms, inference rules, and definitions of proof and theorems [Girle] |
| 7794 | There are seven modalities in S4, each with its negation [Girle] |
| 7793 | ◊p → □◊p is the hallmark of S5 [Girle] |
| 7795 | S5 has just six modalities, and all strings can be reduced to those [Girle] |
| 7787 | Possible worlds logics use true-in-a-world rather than true [Girle] |
| 7788 | Modal logic has four basic modal negation equivalences [Girle] |
| 7796 | Modal logics were studied in terms of axioms, but now possible worlds semantics is added [Girle] |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 7789 | Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 7790 | If an argument is invalid, a truth tree will indicate a counter-example [Girle] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 7800 | Analytic truths are divided into logically and conceptually necessary [Girle] |
| 7801 | Possibilities can be logical, theoretical, physical, economic or human [Girle] |
| 7792 | A world has 'access' to a world it generates, which is important in possible worlds semantics [Girle] |
| 21733 | The right-wing conception of freedom is based on the idea of self-ownership [Cohen,GA] |
| 21739 | Plenty of people have self-ownership, but still lack autonomy [Cohen,GA] |
| 21736 | It is doubtful whether any private property was originally acquired legitimately [Cohen,GA] |
| 21734 | It is plausible that no one has an initial right to own land and natural resources [Cohen,GA] |
| 21735 | Every thing which is now private started out as unowned [Cohen,GA] |