TABLE OF CONTENTS The logic PSL is defined with respect to a non-empty set of atomic propositions P and a given set of boolean expressions B over P . We assume two designated boolean expression true and false belong to B.
Every boolean expression b ? B is a SERE.
If r, r 1 , and r 2 are SEREs, and c is a boolean expression, then the following are SEREs:
|
|
|
|
|
|
|
|
If b is a boolean expression, then both b and b! are FL formulas.
If ? and ? are FL formulas, r, r1, r2 are SEREs, and b a boolean expression, then the following are FL formulas:
|
|
|
|
|
|
|
|
|
|
|
| Note | We define formal semantics for both strong and weak booleans[20]. However, strong booleans are not accessible to the user. |
Every boolean expression is an OBE formula
If f, f 1, and f 2 are OBE formulas, then so are the following:
( f)
f
