Combining Texts

All the ideas for 'fragments/reports', 'The Foundations of Mathematics' and 'Alfred Tarski: life and logic'

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


21 ideas

1. Philosophy / D. Nature of Philosophy / 3. Philosophy Defined
Even pointing a finger should only be done for a reason [Epictetus]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
Infinity: there is an infinity of distinguishable individuals [Ramsey]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / p. Axiom of Reducibility
Reducibility: to every non-elementary function there is an equivalent elementary function [Ramsey]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
Either 'a = b' vacuously names the same thing, or absurdly names different things [Ramsey]
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 says if the sentences are countable, so is the model [Feferman/Feferman]
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
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]
5. Theory of Logic / L. Paradox / 1. Paradox
Contradictions are either purely logical or mathematical, or they involved thought and language [Ramsey]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / d. Logicism critique
Formalists neglect content, but the logicists have focused on generalizations, and neglected form [Ramsey]
6. Mathematics / C. Sources of Mathematics / 7. Formalism
Formalism is hopeless, because it focuses on propositions and ignores concepts [Ramsey]
11. Knowledge Aims / A. Knowledge / 4. Belief / d. Cause of beliefs
I just confront the evidence, and let it act on me [Ramsey]
13. Knowledge Criteria / C. External Justification / 3. Reliabilism / a. Reliable knowledge
A belief is knowledge if it is true, certain and obtained by a reliable process [Ramsey]