display all the ideas for this combination of philosophers
16 ideas
| 13644 | Semantics for models uses set-theory [Shapiro] |
| Full Idea: Typically, model-theoretic semantics is formulated in set theory. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 2.5.1) |
| 10239 | The central notion of model theory is the relation of 'satisfaction' [Shapiro] |
| Full Idea: The central notion of model theory is the relation of 'satisfaction', sometimes called 'truth in a model'. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 4.9) |
| 10240 | Model theory deals with relations, reference and extensions [Shapiro] |
| Full Idea: Model theory determines only the relations between truth conditions, the reference of singular terms, the extensions of predicates, and the extensions of the logical terminology. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 4.9) |
| 13670 | Categoricity can't be reached in a first-order language [Shapiro] |
| Full Idea: Categoricity cannot be attained in a first-order language. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.3) |
| 10214 | Theory ontology is never complete, but is only determined 'up to isomorphism' [Shapiro] |
| Full Idea: No object-language theory determines its ontology by itself. The best possible is that all models are isomorphic, in which case the ontology is determined 'up to isomorphism', but only if the domain is finite, or it is stronger than first-order. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 2.5) | |
| A reaction: This seems highly significant when ontological claims are being made, and is good support for Shapiro's claim that the structures matter, not the objects. There is a parallel in Tarksi's notion of truth-in-all-models. [The Skolem Paradox is the problem] |
| 10238 | The set-theoretical hierarchy contains as many isomorphism types as possible [Shapiro] |
| Full Idea: Set theorists often point out that the set-theoretical hierarchy contains as many isomorphism types as possible; that is the point of the theory. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 4.8) | |
| A reaction: Hence there are a huge number of models for any theory, which are then reduced to the one we want at the level of isomorphism. |
| 13636 | An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro] |
| Full Idea: An axiomatization is 'categorical' if all its models are isomorphic to one another; ..hence it has 'essentially only one' interpretation [Veblen 1904]. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.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) |
| 13658 | Downward Löwenheim-Skolem: each satisfiable countable set always has countable models [Shapiro] |
| Full Idea: A language has the Downward Löwenheim-Skolem property if each satisfiable countable set of sentences has a model whose domain is at most countable. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 6.5) | |
| A reaction: This means you can't employ an infinite model to represent a fact about a countable set. |
| 13659 | Upward Löwenheim-Skolem: each infinite model has infinite models of all sizes [Shapiro] |
| Full Idea: A language has the Upward Löwenheim-Skolem property if for each set of sentences whose model has an infinite domain, then it has a model at least as big as each infinite cardinal. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 6.5) | |
| A reaction: This means you can't have a countable model to represent a fact about infinite sets. |
| 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] |
| 13648 | The Löwenheim-Skolem theorems show an explosion of infinite models, so 1st-order is useless for infinity [Shapiro] |
| Full Idea: The Löwenheim-Skolem theorems mean that no first-order theory with an infinite model is categorical. If Γ has an infinite model, then it has a model of every infinite cardinality. So first-order languages cannot characterize infinite structures. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) | |
| A reaction: So much of the debate about different logics hinges on characterizing 'infinite structures' - whatever they are! Shapiro is a leading structuralist in mathematics, so he wants second-order logic to help with his project. |
| 13675 | Substitutional semantics only has countably many terms, so Upward Löwenheim-Skolem trivially fails [Shapiro] |
| Full Idea: The Upward Löwenheim-Skolem theorem fails (trivially) with substitutional semantics. If there are only countably many terms of the language, then there are no uncountable substitution models. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 9.1.4) | |
| A reaction: Better and better. See Idea 13674. Why postulate more objects than you can possibly name? I'm even suspicious of all real numbers, because you can't properly define them in finite terms. Shapiro objects that the uncountable can't be characterized. |
| 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) |
| 10234 | Any theory with an infinite model has a model of every infinite cardinality [Shapiro] |
| Full Idea: The Löwenheim-Skolem theorems (which apply to first-order formal theories) show that any theory with an infinite model has a model of every infinite cardinality. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 4.8) | |
| A reaction: This aspect of the theorems is the Skolem Paradox. Shapiro argues that in first-order this infinity of models for arithmetic must be accepted, but he defends second-order model theory, where 'standard' models can be selected. |