MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given a classic (not Residuated) lattice, with standard definition of partial order via lattice join and meet operations, is it possible to satisfy Galois equivalence

(x v y) < z <-> x < (y / z).

for some binary operation /?

Edit: One way to answer this is putting lattice axioms together with Galois condition into something like Mace4. Then finite model search reveals that lattice join v appears to have no adjoints, while meet ^ has. The question is more subtle, however: is there adjoint for lattice meet operation in any lattice model?

share|cite|improve this question
Consider what happens when $y>z$. You cannot dualize only some parts of the definition of a Heityng algebra and blindly hope to obtain something useful. – user46855 Feb 16 '14 at 22:07

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.