24 ideas
13030 | Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y) [Kunen] |
13032 | Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z) [Kunen] |
13033 | Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A) [Kunen] |
13037 | Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x) [Kunen] |
13038 | Power Set: ∀x ∃y ∀z(z ⊂ x → z ∈ y) [Kunen] |
13034 | Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen] |
13039 | Foundation:∀x(∃y(y∈x) → ∃y(y∈x ∧ ¬∃z(z∈x ∧ z∈y))) [Kunen] |
13036 | Choice: ∀A ∃R (R well-orders A) [Kunen] |
13029 | Set Existence: ∃x (x = x) [Kunen] |
13031 | Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen] |
13040 | Constructibility: V = L (all sets are constructible) [Kunen] |
18465 | An 'equivalence' relation is one which is reflexive, symmetric and transitive [Kunen] |
12887 | A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim] |
12790 | Generalisations must be invariant to explain anything [Leuridan] |
12789 | Biological functions are explained by disposition, or by causal role [Leuridan] |
14388 | Mechanisms must produce macro-level regularities, but that needs micro-level 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] |
14386 | Mechanisms are ontologically dependent on regularities [Leuridan] |
14389 | There is nothing wrong with an infinite regress of mechanisms and regularities [Leuridan] |
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] |