SAT-P : WFFOP

SAT-P is a wff operation.
Check whether a propositional wff is satisfiable.
 
The calling scheme for SAT-P is:

(SAT-P JFORM)
"JFORM"


The result is of type BOOLEAN.

The arguments have the following meaning:
JFORM : Quantifier-Free Wff

TPS documentation homepage


© 1988-99, Carnegie Mellon University.

TPS homepage