You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Definition A formula is said to be inconsistent (or unsatisfiable) if and only if it is false under all its interpretations. A formula is said to be consistent (or satisfiable) if and only if it is not inconsistent.
ref: Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) 1st Edition,
by Chin-Liang Chang, Richard Char-Tung Lee, p. 11
The text was updated successfully, but these errors were encountered:
Uh oh!
There was an error while loading. Please reload this page.
Definition A formula is said to be inconsistent (or unsatisfiable) if and only if it is false under all its interpretations. A formula is said to be consistent (or satisfiable) if and only if it is not inconsistent.
ref: Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) 1st Edition,
by Chin-Liang Chang, Richard Char-Tung Lee, p. 11
The text was updated successfully, but these errors were encountered: