30 ideas
21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
10807 | Mathematics reduces to set theory, which reduces, with some mereology, to the singleton function [Lewis] |
10809 | We can accept the null set, but not a null class, a class lacking members [Lewis] |
10811 | The null set plays the role of last resort, for class abstracts and for existence [Lewis] |
10812 | The null set is not a little speck of sheer nothingness, a black hole in Reality [Lewis] |
10813 | What on earth is the relationship between a singleton and an element? [Lewis] |
10814 | Are all singletons exact intrinsic duplicates? [Lewis] |
17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
10806 | Megethology is the result of adding plural quantification to mereology [Lewis] |
10816 | We can use mereology to simulate quantification over relations [Lewis] |
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] |
10808 | Mathematics is generalisations about singleton functions [Lewis] |
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] |
10815 | We don't need 'abstract structures' to have structural truths about successor functions [Lewis] |
8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
10810 | I say that absolutely any things can have a mereological fusion [Lewis] |
18284 | Particulars can be verified or falsified, but general statements can only be falsified (conclusively) [Popper] |
3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |