Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'Presupposition' and 'The Theory of Logical Types'

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

13 ideas

4. Formal Logic / A. Syllogistic Logic / 3. Term Logic
19053 Logic would be more natural if negation only referred to predicates [Dummett]
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]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / c. not
19052 Natural language 'not' doesn't apply to sentences [Dummett]
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 / K. Features of Logics / 5. Incompleteness
17894 We have no argument to show a statement is absolutely undecidable [Koellner]
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 / 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]
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]