30 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] |
| 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] |
| 10429 | It is best to say that a name designates iff there is something for it to designate [Sainsbury] |
| 10425 | Definite descriptions may not be referring expressions, since they can fail to refer [Sainsbury] |
| 10438 | Definite descriptions are usually rigid in subject, but not in predicate, position [Sainsbury] |
| 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] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 8983 | If 'red' is vague, then membership of the set of red things is vague, so there is no set of red things [Sainsbury] |
| 8986 | We should abandon classifying by pigeon-holes, and classify around paradigms [Sainsbury] |
| 8982 | Vague concepts are concepts without boundaries [Sainsbury] |
| 8984 | If concepts are vague, people avoid boundaries, can't spot them, and don't want them [Sainsbury] |
| 8985 | Boundaryless concepts tend to come in pairs, such as child/adult, hot/cold [Sainsbury] |
| 20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |
| 10432 | A new usage of a name could arise from a mistaken baptism of nothing [Sainsbury] |
| 10434 | Even a quantifier like 'someone' can be used referentially [Sainsbury] |
| 10431 | Things are thought to have a function, even when they can't perform them [Sainsbury] |