2006
DOI: 10.1007/11828563_11
|View full text |Cite
|
Sign up to set email alerts
|

Relational Representation Theorems for General Lattices with Negations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
40
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(40 citation statements)
references
References 6 publications
0
40
0
Order By: Relevance
“…[1]). Representation theorems for algebras in the above classes can be found in [1,2]. We also consider subclasses of these classes based on distributive lattices, i.e., those satisfying the following identities (D):…”
Section: Preliminariesmentioning
confidence: 93%
See 3 more Smart Citations
“…[1]). Representation theorems for algebras in the above classes can be found in [1,2]. We also consider subclasses of these classes based on distributive lattices, i.e., those satisfying the following identities (D):…”
Section: Preliminariesmentioning
confidence: 93%
“…We consider some classes of (not necessarily distributive) lattices with additional operations as well as logics based on these classes (see [1,2]). A bounded lattice is a lattice A = (A, ∨, ∧, 0, 1), where 0 is the least element and 1 is the greatest element of A.…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…Whether there is an intermediate logic with infinitary unification type is not known. Dzik located logics with unitary unification in the lattice of intermediate logics by showing that all extensions of De Morgan logic have nullary or unitary unification, and that for the latter the converse holds too [6]. There exist modal logics for which the unification problem is undecidable [33], but whether there exists an intermediate logic with this property is unknown.…”
Section: Introductionmentioning
confidence: 99%