23 ideas
| 8368 | A correct definition is what can be substituted without loss of meaning [Ducasse] |
| 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] |
| 11211 | If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt] |
| 11210 | Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt] |
| 11212 | The sense of a connective comes from primitively obvious rules of inference [Rumfitt] |
| 11214 | We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt] |
| 8367 | Causation is defined in terms of a single sequence, and constant conjunction is no part of it [Ducasse] |
| 8372 | We see what is in common between causes to assign names to them, not to perceive them [Ducasse] |
| 8369 | Causes are either sufficient, or necessary, or necessitated, or contingent upon [Ducasse] |
| 8373 | When a brick and a canary-song hit a window, we ignore the canary if we are interested in the breakage [Ducasse] |
| 8370 | A cause is a change which occurs close to the effect and just before it [Ducasse] |
| 8371 | Recurrence is only relevant to the meaning of law, not to the meaning of cause [Ducasse] |
| 8374 | We are interested in generalising about causes and effects purely for practical purposes [Ducasse] |