Categorical universality of regular double p-algebras

An algebra A = (L; ∨, ∧, *, +, 0, 1) of type (2, 2, 1, 1, 0, 0) is a doublep-algebra if (L; ∨, ∧, 0, 1) is a (0, l)-lattice in which * and + are unary operations of pseudocomplementation and dual pseudocomplementation determined by the respective requirements that x ≤ a* be equivalent to x ∧ a = 0, and that x ≥ a+ if and only if x ∨ a = 1.

Universal Varieties Of (0, 1)-Lattices

This article fully characterizes categorically universal varieties of (0, 1)-lattices (that is, lattices with a least element 0 and a greatest element 1 regarded as nullary operations), thereby concluding a series of partial results [3, 5, 8, 10, also 14] which originated with the proof of categorical universality for the variety of all (0, 1)-lattices by Grätzer and Sichler [6].A category C of algebras of a given type is universal if every category of algebras (and equivalently, according to Hedrlín and Pultr [7 or 14], also the category of all graphs) is isomorphic to a full subcategory of C. The universality of C is thus equivalent to the existence of a full embedding Φ : G→C of the category G of all graphs and their compatible mappings into C. When Φ assigns a finite algebra to every finite graph, we say that C is finite-to-finite universal.