48 search results - page 1 / 10 » Lattices of Relatively Axiomatizable Classes |
ICFCA
2007
Springer
13 years 11 months ago
2007
Springer
APAL
2002
13 years 4 months ago
2002
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
ORDER
2010
13 years 3 months ago
2010
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We ...
JLP
2011
12 years 11 months ago
2011
The family of domain algebras provide an elegant formal system for automated reasoning about programme verification. Their primary models are algebras of relations, viz. represen...
ISMVL
2008
IEEE
13 years 11 months ago
2008
IEEE
We investigate a class of metrics on lattices that are compatible with the partial order defined by the lattice using the ternary relation of betweenness that can be naturally de...