18 ideas
10163 | Propositional modal logic has been proved to be complete [Kripke, by Feferman/Feferman] |
10760 | With possible worlds, S4 and S5 are sound and complete, but S1-S3 are not even sound [Kripke, by Rossberg] |
16189 | The variable domain approach to quantified modal logic invalidates the Barcan Formula [Kripke, by Simchen] |
15132 | The Barcan formulas fail in models with varying domains [Kripke, by Williamson] |
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] |
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] |
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] |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
541 | Virtue comes more from habit than character [Critias] |
542 | Fear of the gods was invented to discourage secret sin [Critias] |