32 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] |
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] |
10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
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] |
10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
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] |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
17757 | Members of ordinals are ordinals, and also subsets of ordinals [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] |
13007 | Archimedes defined a straight line as the shortest distance between two points [Archimedes, by Leibniz] |
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] |