On Kalman's functor for bounded hemi-implicative semilattices and hemi-implicative lattices

Abstract

Hemi-implicative semilattices (lattices), originally defined under the name of weak implicative semilattices (lattices), were introduced by the second author of the present paper. A hemi-implicative semilattice is an algebra (H,,→,1) of type (2,2,0) such that (H,) is a meet semilattice, 1 is the greatest element with respect to the order, a→ a = 1 for every a∈ H and for every a, b, c∈ H, if a≤ b→ c then a b ≤ c. A bounded hemi-implicative semilattice is an algebra (H,,→,0,1) of type (2,2,0,0) such that (H,,→,1) is a hemi-implicative semilattice and 0 is the first element with respect to the order. A hemi-implicative lattice is an algebra (H,,,→,0,1) of type (2,2,2,0,0) such that (H,,,0,1) is a bounded distributive lattice and the reduct algebra (H,,→,1) is a hemi-implicative semilattice. In this paper we introduce an equivalence for the categories of bounded hemi-implicative semilattices and hemi-implicative lattices, respectively, which is motivated by an old construction due J. Kalman that relates bounded distributive lattices and Kleene algebras.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…