FiniteLattice(S, p)ΒΆ

logic.spad line 2047

This is the algebration of poset. A big difference between this lattice domain and the poset domain is that, in this domain, the REP holds a single node whereas in poset REP holds the whole poset. Date Created: Aug 2015

/\: (%, %) -> %
from MeetSemilattice
=: (%, %) -> Boolean
from BasicType
\/: (%, %) -> %
from JoinSemilattice
~=: (%, %) -> Boolean
from BasicType
coerce: % -> OutputForm
from CoercibleTo OutputForm
finiteLattice: NonNegativeInteger -> %
construct finite lattice element from index
finiteLattice: S -> %
construct finite lattice element from object
hash: % -> SingleInteger
from SetCategory
hashUpdate!: (HashState, %) -> HashState
from SetCategory
latex: % -> String
from SetCategory

BasicType

CoercibleTo OutputForm

JoinSemilattice

Lattice

MeetSemilattice

SetCategory