Combining Philosophers

All the ideas for Correia,F/Schnieder,B, John Hick and Feferman / Feferman

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

20 ideas

1. Philosophy / E. Nature of Metaphysics / 1. Nature of Metaphysics
17266 Using modal logic, philosophers tried to handle all metaphysics in modal terms [Correia/Schnieder]
2. Reason / B. Laws of Thought / 2. Sufficient Reason
17263 Why do rationalists accept Sufficient Reason, when it denies the existence of fundamental facts? [Correia/Schnieder]
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]
7. Existence / C. Structure of Existence / 1. Grounding / a. Nature of grounding
17270 Is existential dependence by grounding, or do grounding claims arise from existential dependence? [Correia/Schnieder]
7. Existence / C. Structure of Existence / 1. Grounding / c. Grounding and explanation
17268 Grounding is metaphysical and explanation epistemic, so keep them apart [Correia/Schnieder]
7. Existence / D. Theories of Reality / 8. Facts / a. Facts
17267 The identity of two facts may depend on how 'fine-grained' we think facts are [Correia/Schnieder]
29. Religion / D. Religious Issues / 1. Religious Commitment / c. Religious Verification
1470 Belief in an afterlife may be unverifiable in this life, but it will be verifiable after death [Hick, by PG]
1471 It may be hard to verify that we have become immortal, but we could still then verify religious claims [Hick, by PG]
29. Religion / D. Religious Issues / 1. Religious Commitment / d. Religious Falsification
1469 Some things (e.g. a section of the expansion of PI) can be verified but not falsified [Hick, by PG]