Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'On the Frame of Reference' and 'An Introduction to Modal Logic'

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

11 ideas

4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL
9540 A 'value-assignment' (V) is when to each variable in the set V assigns either the value 1 or the value 0 [Hughes/Cresswell]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
9541 The Law of Transposition says (P→Q) → (¬Q→¬P) [Hughes/Cresswell]
4. Formal Logic / B. Propositional Logic PL / 4. Soundness of PL
9543 The rules preserve validity from the axioms, so no thesis negates any other thesis [Hughes/Cresswell]
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 / G. Quantification / 4. Substitutional Quantification
10009 Substitutional quantification is just a variant of Tarski's account [Wallace, by Baldwin]
5. Theory of Logic / K. Features of Logics / 4. Completeness
9544 A system is 'weakly' complete if all wffs are derivable, and 'strongly' if theses are maximised [Hughes/Cresswell]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
17894 We have no argument to show a statement is absolutely undecidable [Koellner]
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]