2018
DOI: 10.18778/0138-0680.47.1.03
|View full text |Cite
|
Sign up to set email alerts
|

PC-lattices: A Class of Bounded BCK-algebras

Abstract: In this paper, we define the notion of PC-lattice, as a generalization of finite positive implicative BCK-algebras with condition (S) and bounded commutative BCK-algebras. We investiate some results for Pc-lattices being a new class of BCK-lattices. Specially, we prove that any Boolean lattice is a PC-lattice and we show that if X is a PC-lattice with condition S, then X is an involutory BCK-algebra if and only if X is a commutative BCK-algebra. Finally, we prove that any PC-lattice with condition (S) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 4 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?