of monadic or relational predicate calculus (Fa, Gb, Rab, Hcd, etc.). • The Boolean Algebra BL set-up by such a language will be such that: – BL will have 2 n states (corresponding to the state descriptions of L) – BL will contain 2 2n propositions, in total. ∗ This is because each proposition p in BL is equivalent to a disjunction of state descriptions. Thus, each subset of the set of...