39 ideas
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10859 | A set is 'well-ordered' if every subset has a first element [Clegg] |
| 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] |
| 10857 | Set theory made a closer study of infinity possible [Clegg] |
| 10864 | Any set can always generate a larger set - its powerset, of subsets [Clegg] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 10872 | Extensionality: Two sets are equal if and only if they have the same elements [Clegg] |
| 10875 | Pairing: For any two sets there exists a set to which they both belong [Clegg] |
| 10876 | Unions: There is a set of all the elements which belong to at least one set in a collection [Clegg] |
| 10878 | Infinity: There exists a set of the empty set and the successor of each element [Clegg] |
| 10877 | Powers: All the subsets of a given set form their own new powerset [Clegg] |
| 10879 | Choice: For every set a mechanism will choose one member of any non-empty subset [Clegg] |
| 10871 | Axiom of Existence: there exists at least one set [Clegg] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 10874 | Specification: a condition applied to a set will always produce a new set [Clegg] |
| 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] |
| 10880 | Mathematics can be 'pure' (unapplied), 'real' (physically grounded); or 'applied' (just applicable) [Clegg] |
| 10860 | An ordinal number is defined by the set that comes before it [Clegg] |
| 10861 | Beyond infinity cardinals and ordinals can come apart [Clegg] |
| 10854 | Transcendental numbers can't be fitted to finite equations [Clegg] |
| 10858 | By adding an axis of imaginary numbers, we get the useful 'number plane' instead of number line [Clegg] |
| 10853 | Either lack of zero made early mathematics geometrical, or the geometrical approach made zero meaningless [Clegg] |
| 10866 | Cantor's account of infinities has the shaky foundation of irrational numbers [Clegg] |
| 10869 | The Continuum Hypothesis is independent of the axioms of set theory [Clegg] |
| 10862 | The 'continuum hypothesis' says aleph-one is the cardinality of the reals [Clegg] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 8628 | I hold that algebra and number are developments of logic [Jevons] |