30 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] |
18767 | Free logics has terms that do not designate real things, and even empty domains [Anderson,CA] |
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] |
18763 | Basic variables in second-order logic are taken to range over subsets of the individuals [Anderson,CA] |
18771 | Stop calling ∃ the 'existential' quantifier, read it as 'there is...', and range over all entities [Anderson,CA] |
13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [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] |
13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [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] |
13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
18769 | Do mathematicians use 'existence' differently when they say some entity exists? [Anderson,CA] |
18770 | We can distinguish 'ontological' from 'existential' commitment, for different kinds of being [Anderson,CA] |
18766 | 's is non-existent' cannot be said if 's' does not designate [Anderson,CA] |
18768 | We cannot pick out a thing and deny its existence, but we can say a concept doesn't correspond [Anderson,CA] |
18765 | Individuation was a problem for medievals, then Leibniz, then Frege, then Wittgenstein (somewhat) [Anderson,CA] |
18764 | The notion of 'property' is unclear for a logical version of the Identity of Indiscernibles [Anderson,CA] |
13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |