more from this thinker
|
more from this text
Single Idea 10894
[filed under theme 5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
]
Full Idea
A propositional logic set of sentences Γ is 'satisfiable' if there is at least one admissible truth-assignment that makes all of its sentences true.
Gist of Idea
A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true
Source
José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4)
Book Ref
Zalabardo,José L.: 'Introduction to the Theory of Logic' [Westview 2000], p.53
The
12 ideas
with the same theme
[evaluating as True after all truth assignments are made]:
|
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]
|