Satisfiability

Satisfiability
http://en.wikipedia.org/wiki/Satisfiability

In mathematical logic, satisfiability and validity are elementary concepts of semantics.
A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.
A formula is valid if all interpretations make the formula true.

The opposites of these concepts are unsatisfiability and invalidity, that is, a formula is unsatisfiable if none of the interpretations make the formula true, and invalid if some such interpretation makes the formula false.
These four concepts are related to each other in a manner exactly analogous to Aristotle’s square of opposition.

concept used by:
Logic: Language and Information 1
The University of Melbourne
https://www.coursera.org/course/logic1

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s