18 ideas
9540 | A 'value-assignment' (V) is when to each variable in the set V assigns either the value 1 or the value 0 [Hughes/Cresswell] |
9541 | The Law of Transposition says (P→Q) → (¬Q→¬P) [Hughes/Cresswell] |
9543 | The rules preserve validity from the axioms, so no thesis negates any other thesis [Hughes/Cresswell] |
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] |
9544 | A system is 'weakly' complete if all wffs are derivable, and 'strongly' if theses are maximised [Hughes/Cresswell] |
8502 | Realism doesn't explain 'a is F' any further by saying it is 'a has F-ness' [Devitt] |
8503 | The particular/universal distinction is unhelpful clutter; we should accept 'a is F' as basic [Devitt] |
8501 | Quineans take predication about objects as basic, not reference to properties they may have [Devitt] |