2018
DOI: 10.3233/fi-2018-1735
|View full text |Cite
|
Sign up to set email alerts
|

Finite IUML-algebras, Finite Forests and Orthopairs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…A clear candidate is the variety of Nilpotent Minimum algebras (NM-algebras for short) that, similarly to Gödel algebras, is dual to a forest-based category (see [6]). Another class of algebras that is dual to forests is that of IUML-algebras, studied in [1]. The latter are algebras based on uninorms rather than t-norms, but similar methods to those developed in the present chapter might be used to define and study modal operators on them.…”
Section: Discussionmentioning
confidence: 96%
See 2 more Smart Citations
“…A clear candidate is the variety of Nilpotent Minimum algebras (NM-algebras for short) that, similarly to Gödel algebras, is dual to a forest-based category (see [6]). Another class of algebras that is dual to forests is that of IUML-algebras, studied in [1]. The latter are algebras based on uninorms rather than t-norms, but similar methods to those developed in the present chapter might be used to define and study modal operators on them.…”
Section: Discussionmentioning
confidence: 96%
“…Let R and R ♦ be as in Section 4, and put R = R ∩ R ♦ . Then, by Proposition 4.3 (1), it follows that (F A , R) is a basic frame.…”
Section: Adding Structure To Gödel Algebras With Operatorsmentioning
confidence: 88%
See 1 more Smart Citation
“…We prove that (A, B) = (X 1 , X 2 ). It is trivial that A ⊆ X 1 and B ⊆ X 2 . Now, we suppose that N ∈ X 1 , and we intend to prove that 13), and so M ⊆ N .…”
Section: Propositionmentioning
confidence: 99%
“…We exclude the operations ⊙ 4 and ֒→ 4 , since they can not be obtained starting from operations between the orthopairs 2. By 15, i ϕ ∧ i ψ = i (ϕ ∧ ψ) 3.…”
mentioning
confidence: 99%