33 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] |
14352 | '¬', '&', and 'v' are truth functions: the truth of the compound is fixed by the truth of the components [Jackson] |
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] |
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] |
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] |
14360 | Possible worlds for subjunctives (and dispositions), and no-truth for indicatives? [Jackson] |
14353 | Modus ponens requires that A→B is F when A is T and B is F [Jackson] |
14354 | When A and B have the same truth value, A→B is true, because A→A is a logical truth [Jackson] |
14355 | (A&B)→A is a logical truth, even if antecedent false and consequent true, so it is T if A is F and B is T [Jackson] |
14358 | In the possible worlds account of conditionals, modus ponens and modus tollens are validated [Jackson] |
14359 | Only assertions have truth-values, and conditionals are not proper assertions [Jackson] |
14357 | Possible worlds account, unlike A⊃B, says nothing about when A is false [Jackson] |
14356 | We can't insist that A is relevant to B, as conditionals can express lack of relevance [Jackson] |
7658 | Obviously there can't be a functional anaylsis of qualia if they are defined by intrinsic properties [Dennett] |
7655 | The work done by the 'homunculus in the theatre' must be spread amongst non-conscious agencies [Dennett] |
7657 | Intelligent agents are composed of nested homunculi, of decreasing intelligence, ending in machines [Dennett] |
7656 | I don't deny consciousness; it just isn't what people think it is [Dennett] |
7654 | What matters about neuro-science is the discovery of the functional role of the chemistry [Dennett] |