36 ideas
| 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] |
| 10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
| 10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
| 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] |
| 10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
| 10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
| 10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
| 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] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all 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] |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| 10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
| 10763 | Completeness and compactness together give axiomatizability [Tharp] |
| 10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
| 10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
| 10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
| 10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
| 10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
| 5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |