25 ideas
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] |
10301 | The axiom of choice is controversial, but it could be replaced [Shapiro] |
10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
10588 | First-order logic is Complete, and Compact, with the Löwenheim-Skolem Theorems [Shapiro] |
10298 | Some say that second-order logic is mathematics, not logic [Shapiro] |
10299 | If the aim of logic is to codify inferences, second-order logic is useless [Shapiro] |
10300 | Logical consequence can be defined in terms of the logical terminology [Shapiro] |
10290 | Second-order variables also range over properties, sets, relations or functions [Shapiro] |
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] |
10292 | Downward Löwenheim-Skolem: if there's an infinite model, there is a countable model [Shapiro] |
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] |
10590 | Up Löwenheim-Skolem: if natural numbers satisfy wffs, then an infinite domain satisfies them [Shapiro] |
10296 | The Löwenheim-Skolem Theorems fail for second-order languages with standard semantics [Shapiro] |
10297 | The Löwenheim-Skolem theorem seems to be a defect of first-order logic [Shapiro] |
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] |
10294 | Second-order logic has the expressive power for mathematics, but an unworkable model theory [Shapiro] |
10591 | Logicians use 'property' and 'set' interchangeably, with little hanging on it [Shapiro] |
22489 | 'Good' is an attributive adjective like 'large', not predicative like 'red' [Geach, by Foot] |