35 ideas
| 13520 | A 'tautology' must include connectives [Wolf,RS] |
| 13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
| 13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
| 13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
| 13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
| 13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
| 13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
| 13534 | In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS] |
| 13535 | First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS] |
| 13733 | Frege considered definite descriptions to be genuine singular terms [Frege, by Fitting/Mendelsohn] |
| 9874 | Contradiction arises from Frege's substitutional account of second-order quantification [Dummett on Frege] |
| 13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS] |
| 13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS] |
| 13531 | Model theory reveals the structures of mathematics [Wolf,RS] |
| 13532 | Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS] |
| 13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
| 13539 | The LST Theorem is a serious limitation of first-order logic [Wolf,RS] |
| 13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
| 13525 | Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS] |
| 4261 | The Lottery Paradox says each ticket is likely to lose, so there probably won't be a winner [Bonjour, by PG] |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| 18252 | Real numbers are ratios of quantities, such as lengths or masses [Frege] |
| 18271 | We can't prove everything, but we can spell out the unproved, so that foundations are clear [Frege] |
| 10623 | Frege defined number in terms of extensions of concepts, but needed Basic Law V to explain extensions [Frege, by Hale/Wright] |
| 9975 | Frege ignored Cantor's warning that a cardinal set is not just a concept-extension [Tait on Frege] |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| 18165 | My Basic Law V is a law of pure logic [Frege] |
| 4255 | Externalist theories of knowledge are one species of foundationalism [Bonjour] |
| 4257 | The big problem for foundationalism is to explain how basic beliefs are possible [Bonjour] |
| 4256 | The main argument for foundationalism is that all other theories involve a regress leading to scepticism [Bonjour] |
| 4258 | Extreme externalism says no more justification is required than the truth of the belief [Bonjour] |
| 4259 | External reliability is not enough, if the internal state of the believer is known to be irrational [Bonjour] |
| 4260 | Even if there is no obvious irrationality, it may be irrational to base knowledge entirely on external criteria [Bonjour] |
| 9190 | A concept is a function mapping objects onto truth-values, if they fall under the concept [Frege, by Dummett] |
| 13665 | Frege took the study of concepts to be part of logic [Frege, by Shapiro] |