The usual axiomatization of residuated lattices involve using ≤. I know I can expand away the use of ≤ using a definition such as (x ≤ y) := (x ∧ y = x), but I fear I will get a set of messy axioms. ...
Is there a standard name for taking a homomorphism from the free object over an algebraic structure? Roughly speaking, this should amount to evaluation of any element of the free object under the ...
What does a coequalizer in the category of primitive recursive functions look like? I know that in Set, a coequalizer is a minimum congruence but...what is it in particular in the category of ...
(Asked by Nathaniel Hellerstein on the Q&A board at JMM) This question is about De Morgan algebras (see also Wikipedia), which are something like Boolean algebras, but with a different weaker ...
(Asked by Nathaniel Hellerstein on the Q&A board at JMM) Let ⋄ be the 4 element lattice τ / \ i j \ / f Is every lattice isomorphic to the fixed point lattice of some ...