Definitions
from Wiktionary, Creative Commons Attribution/ShareAlike License
 n. Able to be satisfied
Etymologies
Sorry, no etymologies found.
Examples

This is especially true for the notions of set and collection in general, for the basic syntactical and semantical concepts of standard classical logic (logical languages of a given order, the notion of satisfiability, definability).

Last fall the former intern dropped by Kautz`s office unannounced to quiz him on an area of computer science called satisfiability testing.

The Skolemizing process may not preserve equivalence but maintains satisfiability, which is enough for clausebased automated reasoning.

That a set of sentences is consistent in Hilbert's sense is a matter that's entirely independent of what its geometric terms mean, and this consistency is immediately implied by the satisfiability of the relation defined by those sentences when their geometric terms are treated as placeholders.

For Frege on the other hand, the differences just listed are crucial, particularly since the consistency of the thoughts expressed by the sentences construed as in (a) above is not implied either by the consistency of the thoughts expressed by those sentences understood as in (b) or by the satisfiability of the relation defined by the sentences understood as in (c).

Both the satisfiability of RAX and the consistency of AX, in the sense under discussion here, are matters that hold entirely independently of the meanings of such geometric terms as “point” and “line,” which serve in Hilbert's work essentially as empty placeholders, susceptible of multiple interpretations.

The full strength of the theory can then be appreciated by considering that its models are closed under each of these functors, modulo the satisfiability of the relevant conditions.

The designated world, also known as the actual world, is required to define truth in such structures (as opposed to global truth or satisfiability).

In Dedekind's case, completeness is to be understood in a semantic sense, as based on categoricity; similarly, consistency is to be understood semantically, as satisfiability by a system of objects

It is remarkable that the satisfiability problem of the binderfree hybrid logic over arbitrary frames is decidable in PSPACE, which is the same as the complexity of deciding satisfiability in ordinary modal logic.
Comments
Log in or sign up to get involved in the conversation. It's quick and easy.