19 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] |
17896 | We need to know the meaning of 'and', prior to its role in reasoning [Prior,AN, by Belnap] |
17898 | Prior's 'tonk' is inconsistent, since it allows the non-conservative inference A |- B [Belnap on Prior,AN] |
11021 | Prior rejected accounts of logical connectives by inference pattern, with 'tonk' his absurd example [Prior,AN, by Read] |
13836 | Maybe introducing or defining logical connectives by rules of inference leads to absurdity [Prior,AN, by Hacking] |
15201 | That Queen Anne is dead is a 'general fact', not a fact about Queen Anne [Prior,AN] |
18465 | An 'equivalence' relation is one which is reflexive, symmetric and transitive [Kunen] |
20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |
22899 | 'Thank goodness that's over' is not like 'thank goodness that happened on Friday' [Prior,AN] |