Combining Philosophers

All the ideas for Hermarchus, Feferman / Feferman and Max J. Cresswell

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

20 ideas

4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / b. System K
14970 Normal system K has five axioms and rules [Cresswell]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / c. System D
14971 D is valid on every serial frame, but not where there are dead ends [Cresswell]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / g. System S4
14972 S4 has 14 modalities, and always reduces to a maximum of three modal operators [Cresswell]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
14973 In S5 all the long complex modalities reduce to just three, and their negations [Cresswell]
4. Formal Logic / D. Modal Logic ML / 7. Barcan Formula
14976 Reject the Barcan if quantifiers are confined to worlds, and different things exist in other worlds [Cresswell]
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
10159 Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
10160 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
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]
8. Modes of Existence / A. Relations / 4. Formal Relations / a. Types of relation
14974 A relation is 'Euclidean' if aRb and aRc imply bRc [Cresswell]
10. Modality / A. Necessity / 4. De re / De dicto modality
14975 A de dicto necessity is true in all worlds, but not necessarily of the same thing in each world [Cresswell]
25. Social Practice / F. Life Issues / 6. Animal Rights
6005 Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley]