display all the ideas for this combination of texts
4 ideas
10292 | Downward Löwenheim-Skolem: if there's an infinite model, there is a countable model [Shapiro] |
Full Idea: Downward Löwenheim-Skolem: a finite or denumerable set of first-order formulas that is satisfied by a model whose domain is infinite is satisfied in a model whose domain is the natural numbers | |
From: Stewart Shapiro (Higher-Order Logic [2001], 2.1) |
10590 | Up Löwenheim-Skolem: if natural numbers satisfy wffs, then an infinite domain satisfies them [Shapiro] |
Full Idea: Upward Löwenheim-Skolem: if a set of first-order formulas is satisfied by a domain of at least the natural numbers, then it is satisfied by a model of at least some infinite cardinal. | |
From: Stewart Shapiro (Higher-Order Logic [2001], 2.1) |
10296 | The Löwenheim-Skolem Theorems fail for second-order languages with standard semantics [Shapiro] |
Full Idea: Both of the Löwenheim-Skolem Theorems fail for second-order languages with a standard semantics | |
From: Stewart Shapiro (Higher-Order Logic [2001], 2.3.2) |
10297 | The Löwenheim-Skolem theorem seems to be a defect of first-order logic [Shapiro] |
Full Idea: The Löwenheim-Skolem theorem is usually taken as a sort of defect (often thought to be inevitable) of the first-order logic. | |
From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) | |
A reaction: [He is quoting Wang 1974 p.154] |