Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'Philosophical Theology' and 'Introduction to Zermelo's 1930 paper'

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


11 ideas

4. Formal Logic / F. Set Theory ST / 1. Set Theory
Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner]
'Reflection principles' say the whole truth about sets can't be captured [Koellner]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
The first-order ZF axiomatisation is highly non-categorical [Hallett,M]
Non-categoricity reveals a sort of incompleteness, with sets existing that the axioms don't reveal [Hallett,M]
4. Formal Logic / F. Set Theory ST / 7. Natural Sets
Zermelo allows ur-elements, to enable the widespread application of set-theory [Hallett,M]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
We have no argument to show a statement is absolutely undecidable [Koellner]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / g. Continuum Hypothesis
The General Continuum Hypothesis and its negation are both consistent with ZF [Hallett,M]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
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
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
Arithmetical undecidability is always settled at the next stage up [Koellner]
28. God / B. Proving God / 3. Proofs of Evidence / b. Teleological Proof
Design is seen in the way ideas match the world, in the mechanisms of evolution, and in values [Tennant,FR, by PG]