more from this thinker | more from this text
Full Idea
Normally, to say that a sentence Φ is 'satisfiable' is to say that there exists a model of Φ.
Gist of Idea
A sentence is 'satisfiable' if it has a model
Source
Stewart Shapiro (Philosophy of Mathematics [1997], 4.8)
Book Ref
Shapiro,Stewart: 'Philosophy of Mathematics:structure and ontology' [OUP 1997], p.135
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.
| 13339 | A sentence is satisfied when we can assert the sentence when the variables are assigned [Tarski] |
| 13340 | Satisfaction is the easiest semantical concept to define, and the others will reduce to it [Tarski] |
| 19140 | 'Satisfaction' is a generalised form of reference [Davidson] |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| 10474 | |= should be read as 'is a model for' or 'satisfies' [Hodges,W] |
| 19317 | An open sentence is satisfied if the object possess that property [Kirkham] |
| 13633 | 'Satisfaction' is a function from models, assignments, and formulas to {true,false} [Shapiro] |
| 10235 | A sentence is 'satisfiable' if it has a model [Shapiro] |
| 15418 | Validity (for truth) and demonstrability (for proof) have correlates in satisfiability and consistency [Burgess] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |