On representation and approximation of operations in Boolean algebras (Q2739008)

By analogy with known results for fuzzy logics, the authors show that some universal approximation and representation results hold for multi-valued Boolean logics. In the reviewer's opinion, this approach would seem to extend to distributive lattices, where it would be useful for the analysis of distributed computing systems of ultrahigh concurrency. No application is given by the authors to systems for missile defense of the Fleet.