It is well known that the laws of logic governing the sentence connectives—“and”, “or”, “not”, etc.—can be expressed by means of equations in the theory of Boolean algebras. The task of providing a similar algebraic setting for the full first-order predicate logic is the primary concern of algebraic logicians. The best-known efforts in this direction are the polyadic algebras of Halmos (cf. ) and the cylindric algebras of Tarski (cf. ), both of which may be described as Boolean algebras with infinitely many additional operations. In particular, there is a primitive operator, cκ, corresponding to each quantification, ∃υκ. In this paper we explore a version of algebraic logic conceived by A. H. Copeland, Sr., and described in , which has this advantage: All operators are generated from a finite set of primitive operations.
Following the theory of cylindric algebras, we introduce, in the natural way, the classes of Copeland set algebras (SCpA), representable Copeland algebras (RCpA), and Copeland algebras of formulas. Playing a central role in the discussion is the set, Γ, of all equations holding in every set algebra. The reason for this is that the operations in a set algebra reflect the notion of satisfaction of a formula in a model, and hence an equation expresses the fact that two formulas are satisfied by the same sequences of objects in the model. Thus to say that an equation holds in every set algebra is to assert that a certain pair of formulas are logically equivalent.