Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'A Completeness Theorem in Modal Logic' and 'What are Sets and What are they For?'

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


20 ideas

4. Formal Logic / D. Modal Logic ML / 1. Modal Logic
Propositional modal logic has been proved to be complete [Kripke, by Feferman/Feferman]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / a. Systems of modal logic
With possible worlds, S4 and S5 are sound and complete, but S1-S3 are not even sound [Kripke, by Rossberg]
4. Formal Logic / D. Modal Logic ML / 7. Barcan Formula
The variable domain approach to quantified modal logic invalidates the Barcan Formula [Kripke, by Simchen]
The Barcan formulas fail in models with varying domains [Kripke, by Williamson]
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 / 3. Types of Set / b. Empty (Null) Set
The empty set is usually derived from Separation, but it also seems to need Infinity [Oliver/Smiley]
The empty set is something, not nothing! [Oliver/Smiley]
We don't need the empty set to express non-existence, as there are other ways to do that [Oliver/Smiley]
Maybe we can treat the empty set symbol as just meaning an empty term [Oliver/Smiley]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The unit set may be needed to express intersections that leave a single member [Oliver/Smiley]
5. Theory of Logic / G. Quantification / 6. Plural Quantification
If you only refer to objects one at a time, you need sets in order to refer to a plurality [Oliver/Smiley]
We can use plural language to refer to the set theory domain, to avoid calling it a 'set' [Oliver/Smiley]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
Logical truths are true no matter what exists - but predicate calculus insists that something exists [Oliver/Smiley]
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 / 4. Using Numbers / g. Applying mathematics
If mathematics purely concerned mathematical objects, there would be no applied mathematics [Oliver/Smiley]
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]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley]