Combinatorics, Computability and Logic 2001
DOI: 10.1007/978-1-4471-0717-0_9
|View full text |Cite
|
Sign up to set email alerts
|

Pseudo-BCK Algebras: An Extension of BCK Algebras

Abstract: Abstract. We extend BCK algebras to pseudo-BCK algebras, as MV algebras and BL algebras were extended to pseudo-MY algebras and pseudo-BL algebras, respectively. We make the connection with pseudo-MV algebras and with pseudo-BL algebras.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
158
0

Year Published

2003
2003
2019
2019

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 141 publications
(159 citation statements)
references
References 8 publications
1
158
0
Order By: Relevance
“…[1]) and, more generally, the class of all pseudo M V -algebras (cf. Georgescu and Iorgulescu [6], [7], and Rachůnek [22]; in [22] the term 'generalized M V -algebra' was applied) are examples of L-varieties.…”
Section: Introductionmentioning
confidence: 99%
“…[1]) and, more generally, the class of all pseudo M V -algebras (cf. Georgescu and Iorgulescu [6], [7], and Rachůnek [22]; in [22] the term 'generalized M V -algebra' was applied) are examples of L-varieties.…”
Section: Introductionmentioning
confidence: 99%
“…It was proved in [6] that bounded commutative pseudo BCK-algebras (called here lattice-ordered pseudo BCK-algebras) are termwise equivalent to pseudo MV-algebras-non-commutative generalizations of MV-algebras introduced by G. Georgescu and A. Iorgulescu [5] and independently by J. Rachunek [16]. The equivalence with the standard signature {©," , 0,1} is given as follows: if (A, -0,1) is a bounded commutative pseudo BCKalgebra and we put x © y = (x 0) -• y = (y -• 0) x, x~ = x -> 0 and = x 0, then (A, ffi,~ , 0,1) is a pseudo MV-algebra, and the reverse passage from (A, ©,~ , 0,1) to (A, -0,1) is given by x -> y = x~ © y and x y = y © .…”
Section: (I) X -• Y < (Y -Y Z) ~> {X -> Z) X Y < (Y Z) -> (X Z) (Iimentioning
confidence: 94%
“…In the logical context this means that the strong conjunction is not commutative and the implication splits into two ones. Accordingly, G. Georgescu and A. Iorgulescu [6] introduced pseudo BCK-algebras as an extension of BCK-algebras: DEFINITION 1.1. A structure {A, <, -1), where < is a binary relation on A, -> and are binary operations on A, and 1 is a distinguished element of A, is called a pseudo BCK-algebra (pedantically, a reversed left pseudo BCK-algebra [10]) if it satisfies the following axioms, for all x,y,z € A:…”
Section: Preliminariesmentioning
confidence: 99%
“…We mention that the above notations differ from the ones introduced in [38], but we use them to be in line with other works ( [37], [9], [8]). Note that in [8], x ∨ 1 y and x ∨ 2 y defined in [38] were replaced for the same reason with the notations:…”
Section: ò ø óò 21º ([38]) a Pseudo-hoop Is An Algebra (Amentioning
confidence: 99%