WFF-SUB-EQUIV* : WFFOP

WFF-SUB-EQUIV* is a wff operation.
Recursively apply the following law to a formula:
A equiv B --> (A implies B) and (B implies A).
 
The calling scheme for WFF-SUB-EQUIV* is:

(WFF-SUB-EQUIV* GWFF)
"GWFF"


The result is of type GWFF.

The arguments have the following meaning:
GWFF : Wff

TPS documentation homepage


© 1988-99, Carnegie Mellon University.

TPS homepage