Combining Texts

All the ideas for 'Rationality', 'Interview with Baggini and Stangroom' and 'Alfred Tarski: life and logic'

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

20 ideas

1. Philosophy / D. Nature of Philosophy / 5. Aims of Philosophy / e. Philosophy as reason
6851 We overvalue whether arguments are valid, and undervalue whether they are interesting [Monk]
2. Reason / A. Nature of Reason / 1. On Reason
6950 You can be rational with undetected or minor inconsistencies [Harman]
2. Reason / A. Nature of Reason / 6. Coherence
6954 A coherent conceptual scheme contains best explanations of most of your beliefs [Harman]
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 / 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]
14. Science / C. Induction / 1. Induction
6955 Enumerative induction is inference to the best explanation [Harman]
14. Science / C. Induction / 3. Limits of Induction
6952 Induction is 'defeasible', since additional information can invalidate it [Harman]
14. Science / C. Induction / 4. Reason in Induction
6953 All reasoning is inductive, and deduction only concerns implication [Harman]
18. Thought / A. Modes of Thought / 5. Rationality / a. Rationality
6951 Ordinary rationality is conservative, starting from where your beliefs currently are [Harman]
22. Metaethics / A. Ethics Foundations / 1. Nature of Ethics / c. Purpose of ethics
6850 Wittgenstein pared his life down in his search for decency [Monk]