digplanet beta 1: Athena
Share digplanet:

Agriculture

Applied sciences

Arts

Belief

Chronology

Culture

Education

Environment

Geography

Health

History

Humanities

Language

Law

Life

Mathematics

Nature

People

Politics

Science

Society

Technology

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.[1] 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.

The four concepts can be raised to apply to whole theories: a theory is satisfiable (valid) if one (all) of the interpretations make(s) each of the axioms of the theory true, and a theory is unsatisfiable (invalid) if all (one) of the interpretations make(s) each of the axioms of the theory false.

It is also possible to consider only interpretations that make all of the axioms of a second theory true. This generalization is commonly called satisfiability modulo theories.

The question whether a sentence in propositional logic is satisfiable is a decidable problem. In general, the question whether sentences in first-order logic are satisfiable is not decidable. In universal algebra and equational theory, the methods of term rewriting, congruence closure and unification are used to attempt to decide satisfiability. Whether or not a particular theory is decidable or not depends whether or not the theory is variable-free or on other conditions.[2]

## Reduction of validity to satisfiability

For classical logics, it is generally possible to reexpress the question of the validity of a formula to one involving satisfiability, because of the relationships between the concepts expressed in the above square of opposition. In particular φ is valid if and only if ¬φ is unsatisfiable, which is to say it is not true that ¬φ is satisfiable. Put another way, φ is satisfiable if and only if ¬φ is invalid.

For logics without negation, such as the positive propositional calculus, the questions of validity and satisfiability may be unrelated. In the case of the positive propositional calculus, the satisfiability problem is trivial, as every formula is satisfiable, while the validity problem is co-NP complete.

## Propositional satisfiability

In the case of classical propositional logic, satisfiability is decidable for propositional formulae. In particular, satisfiability is an NP-complete problem, and is one of the most intensively studied problems in computational complexity theory.

## Satisfiability in first-order logic

Satisfiability is an undecidable and indeed it isn't even a semidecidable property of formulae in first-order logic (FOL).[3] This fact has to do with the undecidability of the validity problem for FOL. The status of such a problem was posed firstly by David Hilbert, in the so called Entscheidungsproblem. The universal validity of a formula is a semi-decidable problem. If satisfiability were also a semi-decidable problem, then the problem of the existence of counter-models would be too (a formula has counter-models iff its negation is satisfiable). So the problem of logical validity would be decidable, which contradicts the Church-Turing theorem, a result stating the negative answer for the Entscheidungsproblem.

## Satisfiability in model theory

In model theory, an atomic formula is satisfiable if there is a collection of elements of a structure that render the formula true.[4] If A is a structure, φ is a formula, and a is a collection of elements, taken from the structure, that satisfy φ, then it is commonly written that

A ⊧ φ [a]

If φ has no variables, that is, if φ is an atomic sentence, and it is satisfied by A, then one writes

A ⊧ φ

In this case, one may also say that A is a model for φ, or that φ is true in A. If T is a collection of atomic sentences (a theory) satisfied by A, one writes

A ⊧ T

## Notes

1. ^ See, for example, Boolos and Jeffrey, 1974, chapter 11.
2. ^ Franz Baader; Tobias Nipkow (1998). Term Rewriting and All That. Cambridge University Press. pp. 58–92. ISBN 0-521-77920-0.
3. ^ Baier, Christel (2012). "Chapter 1.3 Undecidability of FOL". Lecture Notes — Advanced Logics. Technische Universität Dresden — Institute for Technical Computer Science. pp. 28–32. Retrieved 21 July 2012 at 13:25.
4. ^ Wilifrid Hodges (1997). A Shorter Model Theory. Cambridge University Press. p. 12. ISBN 0-521-58713-1.

## References

• Boolos and Jeffrey, 1974. Computability and Logic. Cambridge University Press.

Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Satisfiability — Please support Wikipedia.
A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
 266 videos foundNext >
 266 videos foundNext >
 3 news items
 D-Wave wins the quantum-classical horse race, kind of Register Tue, 14 May 2013 17:06:27 -0700 The tests were run on various problems that fall into the NP-Hard category: quadratic unconstrained binary optimisation, QUBO (a pattern matching problem), the weighted maximum 2-satisfiability problem (W2SAT), and the quadratic assignment problem ... Ars Technica D-Wave's quantum optimizer pitted against traditional computers Ars Technica Mon, 13 May 2013 14:26:24 -0700 The precise problems they tested are termed the Quadratic Unconstrained Binary Optimization (QUBO), Weighted Maximum 2-Satisfiability, and Quadratic Assignment Problem. The software was run on a set of seven quad-core Xeons. D-Wave's hardware ... U.S. Patents Awarded to Inventors in New Mexico (April 29) Targeted News Service (subscription) Mon, 29 Apr 2013 11:40:48 -0700 The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively ...
 Limit to books that you can completely read online Include partial books (book previews) .gsc-branding { display:block; }

Oops, we seem to be having trouble contacting Twitter

# Talk About Satisfiability

You can talk about Satisfiability with people all over the world in our discussions.

#### Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!