Abstract

From a general algebraic point of view, this paper aims at providing an algebraic analysis for binary lattice-valued relations based on lattice implication algebras--a kind of lattice-valued propositional logical algebra. By abstracting away from the concrete lattice-valued relations and the operations on them, such as composition and converse, the notion of lattice-valued relation algebra is introduced, LRA for short. The reduct of an LRA is a lattice implication algebra. Such an algebra generalizes Boolean relation algebras by general distributive lattices and can provide a fundamental algebraic theory for establishing lattice-valued first-order logic. Some important results are generalized from the classical case. The notion of cylindric filter is introduced and the generated cylindric filters are characterized.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call