Calvin C. Elgot, Stephen L. Bloom, et al.
Journal of Computer and System Sciences
A signed ∑-equation is an expression of the form t ≈ t′ or t ≉t′, where t and t′ are ∑-terms (for some ranked set ∑). We characterize those classes of ∑-algebras which are models of a set of signed ∑-equations. Further we consider the problem of finding a complete deductive system analogous to equational logic for the logical consequence operation restricted to signed equations. © 1982 Polish Academy of Sciences.
Calvin C. Elgot, Stephen L. Bloom, et al.
Journal of Computer and System Sciences
Stephen L. Bloom, James W. Thatcher, et al.
Journal of Computer and System Sciences
Stephen L. Bloom, Calvin C. Elgot
Journal of Computer and System Sciences
Stephen L. Bloom, Susanna Ginali, et al.
Journal of Computer and System Sciences