Combining Philosophers

All the ideas for George Boole, Michael D. Resnik and Feferman / Feferman

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

24 ideas

4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
8083 Boole applied normal algebra to logic, aiming at an algebra of thought [Boole, by Devlin]
7727 Boole's notation can represent syllogisms and propositional arguments, but not both at once [Boole, by Weiner]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
6299 Axioms are often affirmed simply because they produce results which have been accepted [Resnik]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
10147 The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman]
10148 Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman]
10149 Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman]
10150 The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman]
10146 Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
5. Theory of Logic / A. Overview of Logic / 2. History of Logic
8686 Boole made logic more mathematical, with algebra, quantifiers and probability [Boole, by Friend]
5. Theory of Logic / H. Proof Systems / 2. Axiomatic Proof
22277 Boole's method was axiomatic, achieving economy, plus multiple interpretations [Boole, by Potter]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
10158 A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman]
10162 Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
10160 Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman]
10159 Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 4. Completeness
10161 If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 7. Decidability
10156 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
10155 Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]
6. Mathematics / A. Nature of Mathematics / 1. Mathematics
6304 Mathematical realism says that maths exists, is largely true, and is independent of proofs [Resnik]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / a. Structuralism
6300 Mathematical constants and quantifiers only exist as locations within structures or patterns [Resnik]
6303 Sets are positions in patterns [Resnik]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / d. Platonist structuralism
6302 Structuralism must explain why a triangle is a whole, and not a random set of points [Resnik]
6295 There are too many mathematical objects for them all to be mental or physical [Resnik]
6296 Maths is pattern recognition and representation, and its truth and proofs are based on these [Resnik]
6301 Congruence is the strongest relationship of patterns, equivalence comes next, and mutual occurrence is the weakest [Resnik]