Combining Texts

All the ideas for 'Deflationary Metaontology of Thomasson', 'Alfred Tarski: life and logic' and 'The Theory of Logical Types'

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

19 ideas

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 / E. Structures of Logic / 5. Functions in Logic
21566 'Propositional functions' are ambiguous until the variable is given a value [Russell]
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]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
21567 'All judgements made by Epimenedes are true' needs the judgements to be of the same type [Russell]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / b. Type theory
23457 Type theory cannot identify features across levels (because such predicates break the rules) [Morris,M on Russell]
21556 Classes are defined by propositional functions, and functions are typed, with an axiom of reducibility [Russell, by Lackey]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
21568 A one-variable function is only 'predicative' if it is one order above its arguments [Russell]
9. Objects / A. Existence of Objects / 5. Individuation / e. Individuation by kind
14082 No sortal could ever exactly pin down which set of particles count as this 'cup' [Schaffer,J]
9. Objects / F. Identity among Objects / 6. Identity between Objects
14081 Identities can be true despite indeterminate reference, if true under all interpretations [Schaffer,J]