|Satisfiability, logic: a statement can be satisfied if there is an interpretation (e.g. an insertion of constants instead of variables), in which the statement is true. E.g. tautologies are always satisfied, contradictions are never satisfied. See also tautology, contradiction, contingency, satisfaction, models, model theory.|
Books on Amazon
|Satisfiability||Berka I 482
Satisfiability/Tarski: depends only on those terms of the sequence from which (with respect to their indices) correspond to the free variables of propositional functions - in the case of a statement (without free variables) the satisfiability does not depend on the properties of the links - each infinite sequence of class satisfies a given true statement - (because it does not contain free variables) - false statement: satisfied by no sequence - variant: satisfiability by finite sequences: according to this view, only the empty sequence satisfies a true statement (because this one has no variables).
Berka I 483
Satisfiability/sequences/statements/Tarski: (here: by finite sequences): E.g. the statement (not propositional function) L1U2l1,2. i.e. "PxlNPxllNIxlxll" according to Definition 22 (satisfiability) satisfies the propositioinal function L1,2 those and only those sequences f of classes for which f1
Being satisfied/satisfiability/Tarski: previously ambiguous because of relations of different linking numbers or between object and classes, or areas of different semantic categories - therefore actually an infinite number of different satisfiability-concepts - Problem: then no uniform method for construction of the concept of the true statement - solution: recourse to the class calculus: Satisfiability by succession of objects.
Logic, Semantics, Metamathematics: Papers from 1923-38 Indianapolis 1983
K. Berka/L. Kreiser
Logik Texte Berlin 1983