39 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] |
| 17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
| 17765 | Propositional language can only relate statements as the same or as different [Walicki] |
| 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] |
| 17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
| 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] |
| 17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
| 17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
| 17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
| 17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
| 7789 | Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle] |
| 7790 | If an argument is invalid, a truth tree will indicate a counter-example [Girle] |
| 17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
| 17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
| 17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
| 17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
| 17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
| 17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
| 17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
| 17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
| 17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
| 17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
| 17754 | Inductive proof depends on the choice of the ordering [Walicki] |
| 17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
| 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] |
| 6613 | The natural kinds are objects, processes and properties/relations [Ellis] |
| 6616 | Least action is not a causal law, but a 'global law', describing a global essence [Ellis] |
| 6615 | A species requires a genus, and its essence includes the essence of the genus [Ellis] |
| 6614 | A hierarchy of natural kinds is elaborate ontology, but needed to explain natural laws [Ellis] |
| 6612 | Without general principles, we couldn't predict the behaviour of dispositional properties [Ellis] |