37 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] |
| 10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
| 10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
| 10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
| 10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
| 10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
| 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] |
| 10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
| 10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
| 10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
| 10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
| 10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
| 10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
| 10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
| 16554 | Activities have place, rate, duration, entities, properties, modes, direction, polarity, energy and range [Machamer/Darden/Craver] |
| 18465 | An 'equivalence' relation is one which is reflexive, symmetric and transitive [Kunen] |
| 16556 | Penicillin causes nothing; the cause is what penicillin does [Machamer/Darden/Craver] |
| 16562 | We understand something by presenting its low-level entities and activities [Machamer/Darden/Craver] |
| 16563 | The explanation is not the regularity, but the activity sustaining it [Machamer/Darden/Craver] |
| 16555 | Functions are not properties of objects, they are activities contributing to mechanisms [Machamer/Darden/Craver] |
| 16528 | Mechanisms are not just push-pull systems [Machamer/Darden/Craver] |
| 16529 | Mechanisms are systems organised to produce regular change [Machamer/Darden/Craver] |
| 16530 | A mechanism explains a phenomenon by showing how it was produced [Machamer/Darden/Craver] |
| 16553 | Our account of mechanism combines both entities and activities [Machamer/Darden/Craver] |
| 16559 | Descriptions of explanatory mechanisms have a bottom level, where going further is irrelevant [Machamer/Darden/Craver] |
| 16564 | There are four types of bottom-level activities which will explain phenomena [Machamer/Darden/Craver] |
| 16561 | We can abstract by taking an exemplary case and ignoring the detail [Machamer/Darden/Craver] |
| 16558 | Laws of nature have very little application in biology [Machamer/Darden/Craver] |