Combining Philosophers

All the ideas for Herodotus, Alan Musgrave and Feferman / Feferman

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


21 ideas

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman]
Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman]
Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman]
The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman]
Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
5. Theory of Logic / C. Ontology of Logic / 3. If-Thenism
Perhaps If-thenism survives in mathematics if we stick to first-order logic [Musgrave]
The If-thenist view only seems to work for the axiomatised portions of mathematics [Musgrave]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
A statement is logically true if it comes out true in all interpretations in all (non-empty) domains [Musgrave]
Logical truths may contain non-logical notions, as in 'all men are men' [Musgrave]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman]
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
Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 4. Completeness
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
'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
No two numbers having the same successor relies on the Axiom of Infinity [Musgrave]
6. Mathematics / C. Sources of Mathematics / 7. Formalism
Formalism is a bulwark of logical positivism [Musgrave]
Formalism seems to exclude all creative, growing mathematics [Musgrave]
19. Language / A. Nature of Meaning / 5. Meaning as Verification
Logical positivists adopted an If-thenist version of logicism about numbers [Musgrave]
29. Religion / D. Religious Issues / 2. Immortality / a. Immortality
The Egyptians were the first to say the soul is immortal and reincarnated [Herodotus]