38 ideas
| 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] |
| 17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
| 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] |
| 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] |
| 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] |
| 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] |
| 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] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 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] |
| 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] |
| 17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
| 17761 | A compact axiomatisation makes it possible to understand a field as a whole [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] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 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] |
| 5994 | Is the cosmos open or closed, mechanical or teleological, alive or inanimate, and created or eternal? [Robinson,TM, by PG] |