display all the ideas for this combination of texts
13 ideas
| 10259 | The two standard explanations of consequence are semantic (in models) and deductive [Shapiro] |
| Full Idea: The two best historical explanations of consequence are the semantic (model-theoretic), and the deductive versions. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 7.2) | |
| A reaction: Shapiro points out the fictionalists are in trouble here, because the first involves commitment to sets, and the second to the existence of deductions. |
| 10257 | Intuitionism only sanctions modus ponens if all three components are proved [Shapiro] |
| Full Idea: In some intuitionist semantics modus ponens is not sanctioned. At any given time there is likely to be a conditional such that it and its antecedent have been proved, but nobody has bothered to prove the consequent. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 6.7) | |
| A reaction: [He cites Heyting] This is a bit baffling. In what sense can 'it' (i.e. the conditional implication) have been 'proved' if the consequent doesn't immediately follow? Proving both propositions seems to make the conditional redundant. |
| 10253 | Either logic determines objects, or objects determine logic, or they are separate [Shapiro] |
| Full Idea: Ontology does not depend on language and logic if either one has the objects determining the logic, or the objects are independent of the logic. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 6.4) | |
| A reaction: I favour the first option. I think we should seek an account of how logic grows from our understanding of the physical world. If this cannot be established, I shall invent a new Mad Logic, and use it for all my future reasoning, with (I trust) impunity. |
| 10251 | The law of excluded middle might be seen as a principle of omniscience [Shapiro] |
| Full Idea: The law of excluded middle might be seen as a principle of omniscience. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 6.3) | |
| A reaction: [E.Bishop 1967 is cited] Put that way, you can see why a lot of people (such as intuitionists in mathematics) might begin to doubt it. |
| 10212 | Classical connectives differ from their ordinary language counterparts; '∧' is timeless, unlike 'and' [Shapiro] |
| Full Idea: To some extent, every truth-functional connective differs from its counterpart in ordinary language. Classical conjunction, for example, is timeless, whereas the word 'and' often is not. 'Socrates runs and Socrates stops' cannot be reversed. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 3) | |
| A reaction: Shapiro suggests two interpretations: either the classical connectives are revealing the deeper structure of ordinary language, or else they are a simplification of it. |
| 10209 | A function is just an arbitrary correspondence between collections [Shapiro] |
| Full Idea: The modern extensional notion of function is just an arbitrary correspondence between collections. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 1) | |
| A reaction: Shapiro links this with the idea that a set is just an arbitrary collection. These minimalist concepts seem like a reaction to a general failure to come up with a more useful and common sense definition. |
| 10268 | Maybe plural quantifiers should be understood in terms of classes or sets [Shapiro] |
| Full Idea: Maybe plural quantifiers should themselves be understood in terms of classes (or sets). | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 7.4) | |
| A reaction: [Shapiro credits Resnik for this criticism] |
| 10235 | A sentence is 'satisfiable' if it has a model [Shapiro] |
| Full Idea: Normally, to say that a sentence Φ is 'satisfiable' is to say that there exists a model of Φ. | |
| From: Stewart Shapiro (Philosophy of Mathematics [1997], 4.8) | |
| A reaction: Nothing is said about whether the model is impressive, or founded on good axioms. Tarski builds his account of truth from this initial notion of satisfaction. |
| 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) |
| 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) |
| 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. |
| 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. |