25 ideas
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] |
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] |
10245 | One geometry cannot be more true than another [Poincaré] |
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] |
8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
10369 | How fine-grained Kim's events are depends on how finely properties are individuated [Kim, by Schaffer,J] |
8976 | If events are ordered triples of items, such things seem to be sets, and hence abstract [Simons on Kim] |
8975 | Events cannot be merely ordered triples, but must specify the link between the elements [Kim, by Simons] |
8974 | Events are composed of an object with an attribute at a time [Kim, by Simons] |
8977 | Since properties like self-identity and being 2+2=4 are timeless, Kim must restrict his properties [Simons on Kim] |
8980 | Kim's theory results in too many events [Simons on Kim] |
3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |