Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'Summula philosophiae naturalis' and 'Alfred Tarski: life and logic'

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

21 ideas

4. Formal Logic / F. Set Theory ST / 1. Set Theory
17884 Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner]
17893 'Reflection principles' say the whole truth about sets can't be captured [Koellner]
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 / 5. Incompleteness
17894 We have no argument to show a statement is absolutely undecidable [Koellner]
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]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
17890 There are at least eleven types of large cardinal, of increasing logical strength [Koellner]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
17887 PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
17891 Arithmetical undecidability is always settled at the next stage up [Koellner]
7. Existence / E. Categories / 5. Category Anti-Realism
16608 Ockham was an anti-realist about the categories [William of Ockham, by Pasnau]
9. Objects / C. Structure of Objects / 4. Quantity of an Object
16599 Ockham says matter must be extended, so we don't need Quantity [William of Ockham, by Pasnau]
16681 Matter gets its quantity from condensation and rarefaction, which is just local motion [William of Ockham]