Combining Philosophers

All the ideas for Anaximenes, Robert S. Wolf and Engelbretsen,G/Sayward,C

expand these ideas     |    start again     |     specify just one area for these philosophers


28 ideas

4. Formal Logic / A. Syllogistic Logic / 1. Aristotelian Logic
The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward]
Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward]
4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward]
4. Formal Logic / A. Syllogistic Logic / 3. Term Logic
Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL
A 'tautology' must include connectives [Wolf,RS]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / c. Derivation rules of PL
Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / d. Universal quantifier ∀
Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS]
Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / e. Existential quantifier ∃
Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / e. Axiom of the Empty Set IV
Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS]
First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
Model theory reveals the structures of mathematics [Wolf,RS]
Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS]
Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS]
First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS]
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
The LST Theorem is a serious limitation of first-order logic [Wolf,RS]
5. Theory of Logic / K. Features of Logics / 4. Completeness
If a theory is complete, only a more powerful language can strengthen it [Wolf,RS]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward]
5. Theory of Logic / K. Features of Logics / 10. Monotonicity
Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Modern mathematics has unified all of its objects within set theory [Wolf,RS]
26. Natural Theory / A. Speculations on Nature / 6. Early Matter Theories / c. Ultimate substances
For Anaximenes nature is air, which takes different forms by rarefaction and condensation [Anaximenes, by Simplicius]