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] |
| 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] |
| 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] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 12790 | Generalisations must be invariant to explain anything [Leuridan] |
| 12789 | Biological functions are explained by disposition, or by causal role [Leuridan] |
| 14386 | Mechanisms are ontologically dependent on regularities [Leuridan] |
| 12787 | Mechanisms can't explain on their own, as their models rest on pragmatic regularities [Leuridan] |
| 14384 | We can show that regularities and pragmatic laws are more basic than mechanisms [Leuridan] |
| 14388 | Mechanisms must produce macro-level regularities, but that needs micro-level regularities [Leuridan] |
| 14389 | There is nothing wrong with an infinite regress of mechanisms and regularities [Leuridan] |
| 20751 | As a young girl assumes her status as feminine, she acts in a more fragile immobile way [Young,IM] |
| 14387 | Rather than dispositions, functions may be the element that brought a thing into existence [Leuridan] |
| 14382 | Pragmatic laws allow prediction and explanation, to the extent that reality is stable [Leuridan] |
| 14385 | Strict regularities are rarely discovered in life sciences [Leuridan] |
| 14383 | A 'law of nature' is just a regularity, not some entity that causes the regularity [Leuridan] |