Semi-Boolean lattices

DOI10.1305/ndjfl/1093893707zbMath0185.03802OpenAlexW2068044462MaRDI QIDQ2536070

William C. Nemitz

Publication date: 1969

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093893707

zbMATH Keywords

ordered sets, lattices

Related Items (7)

Subdirect products of totally ordered BCK-algebras ⋮ Applying relation algebra and RelView to solve problems on orders and lattices ⋮ Basic hoops: an algebraic study of continuous t-norms ⋮ Implicative Homomorphisms with Finite Ranges ⋮ Irreducibility in implicative semilattices ⋮ Semi-Heyting Algebras and Identities of Associative Type ⋮ On the structure of varieties with equationally definable principal congruences. I

This page was built for publication: Semi-Boolean lattices