43 ideas
| 10571 | Concern for rigour can get in the way of understanding phenomena [Fine,K] |
| 21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
| 17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
| 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] |
| 10565 | There is no stage at which we can take all the sets to have been generated [Fine,K] |
| 10564 | We might combine the axioms of set theory with the axioms of mereology [Fine,K] |
| 10569 | If you ask what F the second-order quantifier quantifies over, you treat it as first-order [Fine,K] |
| 10570 | Assigning an entity to each predicate in semantics is largely a technical convenience [Fine,K] |
| 17886 | The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner] |
| 10071 | Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P] |
| 19123 | If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh] |
| 10621 | Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel] |
| 17888 | The undecidable sentence can be decided at a 'higher' level in the system [Gödel] |
| 10132 | There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman] |
| 10573 | Dedekind cuts lead to the bizarre idea that there are many different number 1's [Fine,K] |
| 10575 | Why should a Dedekind cut correspond to a number? [Fine,K] |
| 10574 | Unless we know whether 0 is identical with the null set, we create confusions [Fine,K] |
| 3198 | Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey] |
| 10072 | First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P] |
| 9590 | Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman] |
| 11069 | Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna] |
| 10118 | First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman] |
| 10122 | Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman] |
| 10611 | There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P] |
| 10867 | 'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg] |
| 10560 | Set-theoretic imperialists think sets can represent every mathematical object [Fine,K] |
| 10568 | Logicists say mathematics can be derived from definitions, and can be known that way [Fine,K] |
| 8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
| 10563 | A generative conception of abstracts proposes stages, based on concepts of previous objects [Fine,K] |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |
| 10561 | Abstraction-theoretic imperialists think Fregean abstracts can represent every mathematical object [Fine,K] |
| 10562 | We can combine ZF sets with abstracts as urelements [Fine,K] |
| 10567 | We can create objects from conditions, rather than from concepts [Fine,K] |