29 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] |
| 14239 | The empty set is usually derived from Separation, but it also seems to need Infinity [Oliver/Smiley] |
| 14240 | The empty set is something, not nothing! [Oliver/Smiley] |
| 14241 | We don't need the empty set to express non-existence, as there are other ways to do that [Oliver/Smiley] |
| 14242 | Maybe we can treat the empty set symbol as just meaning an empty term [Oliver/Smiley] |
| 14243 | The unit set may be needed to express intersections that leave a single member [Oliver/Smiley] |
| 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] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 14234 | If you only refer to objects one at a time, you need sets in order to refer to a plurality [Oliver/Smiley] |
| 14237 | We can use plural language to refer to the set theory domain, to avoid calling it a 'set' [Oliver/Smiley] |
| 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] |
| 14245 | Logical truths are true no matter what exists - but predicate calculus insists that something exists [Oliver/Smiley] |
| 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] |
| 14246 | If mathematics purely concerned mathematical objects, there would be no applied mathematics [Oliver/Smiley] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 14247 | Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley] |
| 16706 | Generation is when local motions aggregate to become a single subject [Nicholas of Autrecourt] |