39 ideas
22438 | Philosophy is largely concerned with finding the minimum that science could get by with [Quine] |
22436 | Logicians don't paraphrase logic into language, because they think in the symbolic language [Quine] |
22431 | Good algorithms and theories need many occurrences of just a few elements [Quine] |
13838 | A decent modern definition should always imply a semantics [Hacking] |
21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
22435 | The logician's '→' does not mean the English if-then [Quine] |
13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
22433 | It is important that the quantification over temporal entities is timeless [Quine] |
17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
22437 | Logical languages are rooted in ordinary language, and that connection must be kept [Quine] |
22434 | Reduction to logical forms first simplifies idioms and grammar, then finds a single reading of it [Quine] |
13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
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] |
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] |
22432 | Normally conditionals have no truth value; it is the consequent which has a conditional truth value [Quine] |
3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |
22430 | If we understand a statement, we know the circumstances of its truth [Quine] |
13713 | Quine holds time to be 'space-like': past objects are as real as spatially remote ones [Quine, by Sider] |