Hilbert algebras as implicative partial semilattices
|
|
- Charla O’Neal’
- 5 years ago
- Views:
Transcription
1 DOI: /s Research article CEJM 5(2) Hilbert algebras as implicative partial semilattices Jānis Cīrulis University of Latvia, LV-1586 Riga, Latvia Received 15 August 2006; accepted 16 February 2007 Abstract: The infimum of elements a and b of a Hilbert algebra are said to be the compatible meet of a and b, if the elements a and b are compatible in a certain strict sense. The subject of the paper will be Hilbert algebras equipped with the compatible meet operation, which normally is partial. A partial lower semilattice is shown to be a reduct of such an expanded Hilbert algebra iff both algebras have the same filters. An expanded Hilbert algebra is actually an implicative partial semilattice (i.e., a relative subalgebra of an implicative semilattice), and conversely. The implication in an implicative partial semilattice is characterised in terms of filters of the underlying partial semilattice. c Versita Warsaw and Springer-Verlag Berlin Heidelberg. All rights reserved. Keywords: Compatible elements, filter, Hilbert algebra, implication, implicative semilattice, meet, partial semilattice MSC (2000): 06A12, 03G25 1 Introduction Hilbert algebras, or positive implication algebras [35], are the duals of Henkin algebras called by him implicative models in [21] (this term has also been used for Hilbert algebras [30, 31]). Positive implicative BCK-algebras [24] are actually another version of Henkin algebras (see, e.g. [28, 37]). As a matter of fact, these algebras are an algebraic counterpart of positive implicational calculus. Various expansions of Hilbert algebras by a conjunction-like operation have also been studied in the literature. The most extensively investigated among them are implicative semilattices [13, 34], which are known also as Brouwerian semilattices. The so called (H)-Hilbert algebras [22] also have turned out to be another form of implicative semilattices. jc@lanet.lv
2 J. Cīrulis / Central European Journal of Mathematics 5(2) Hilbert algebras in which all meets exist also have been studied; an important recent paper on this subject is [16]. Unfortunately, both these algebras and implicative semilattices have been mentioned in the literature under the same name Hertz algebras; this has caused several misunderstandings see Section 3 below for a brief account of them; cf. also the discussion in [10, 17]. It was demonstrated in [12] by the present author that certain constructions and results can be transferred from implicative semilattices to Hilbert algebras equipped with the so called compatible meet operation. The infimum of elements a and b of a Hilbert algebra is said to be the compatible meet of a and b, if the elements a and b are compatible in a certain strict sense that goes back to [30]. Therefore, this operation is normally partial. In this paper we study elementary algebraic properties of the compatible meet operation and its connection with implication. In particular, we show in what sense Hilbert algebras can be treated as implicative partial semilattices. The paper is structured as follows. Section 2 contains general information on Hilbert algebras, including a description of their filter lattices. Section 3 is concerned with compatible meets and partial semilattices. It is shown here that a Hilbert algebra is a partial semilattice in the sense of [18] with respect to the compatible meet operation, and that a partial semilattice is a reduct of a Hilbert algebra if and only if both algebras have the same filters. The concept of an implicative partial semilattice as a relative subalgebra of an implicative semilattice is introduced in Section 4. Also a theorem stating that implicative partial semilattices are just Hilbert algebras equipped with the partial compatible meet operation is proved here. Furthermore, implication in partial semilattices is characterized both by some explicit conditions on this operation and in terms of filters. 2 Preliminaries: Hilbert algebras An implicative algebra (see [35]) may be defined as an algebra (A,, 1) of type (2,0) such that the relation introduced on A by x y if and only if x y =1 (1) is a partial order with 1 the greatest element. A positive implication algebra [35] or, more concisely, Hilbert algebra [14, 15] is an implicative algebra in which the following inequalities hold: 1 : x y x, 2 : x.y z x y..x z. Following [9, 12], we avoid parentheses as a tool for grouping in favour of dots. For example, the term (x ((y z) x)) (z (x y)) is coded in the dot notation as x :y z. x :z.x y. The above characterization of Hilbert algebras is a bit redundant. On the other hand, the class of all Hilbert algebras considered as algebras of the form (A,, 1) is equationally definable [14, 15]. The following useful algebraic properties of the operation in Hilbert algebras can be found, e.g., in [4, 12, 14, 15, 31, 35].
3 266 J. Cīrulis / Central European Journal of Mathematics 5(2) : x 1, 4 : x 1=1, 5 : x x =1, 6 : if x y, theny z x z, 7 : if x y, thenz x z y, 8 : x.x y = x y, 9 : x.y z = y.x z, 10 : x.y z = x y..x z, 11 : x y. y: y = x y, 12 : x x y. y. A Hilbert algebra A is said to be an implication algebra [35] if the inequality 13 : x y. x x or, equivalently, if any of the equations 14 : x y. x = x, 15 : x y. y = y x. x hold in it for all x and y. In this case either side of the latter one presents the join of x and y: x y = x y. y. Moreover, then any pair of elements of A bounded from below has also the meet: for any z x, y, xy = x.y z: z, and every principal order filter of A turns out to be a Boolean lattice w.r.t. these operations. See [1, 2] for more information on implication algebras. In [20, 26], Hilbert algebras satisfying 15 were said to be commutative, and those satisfying 13 have also been called Tarski algebras in the literature. Another proper subclass of the class of all Hilbert algebras is that of relatively pseudocomplemented posets [36], i.e., unital posets in which the operation, following [27], is defined by a b := max{x: z a, z x imply z b for all z}. Such posets were called implicative in [33], and Brouwer ordered, in [19]. Relatively pseudocomplemented lower semilattices are known also as implicative semilattices [13, 34], or Brouwerian semilattices. A unital poset (A,, 1) can be turned into a Hilbert algebra also by setting 1ifa b, a b := b otherwise. This well-known example of a Hilbert algebra goes back to [14, 15]; see also [30]. Hilbert algebras of this kind were recently studied in [7] under the name order algebra; they have also be called pure Hilbert algebras (see, e.g., [3] and reference [3] therein).
4 J. Cīrulis / Central European Journal of Mathematics 5(2) Let (A,, 1) be some Hilbert algebra. A subalgebra B of A is said to be a block if it is a bounded implication algebra. In this case, if p is the least element of B, then x = x p. p for all x B. (2) Theorem 2.1. AsubsetB of A is a block if and only if there is a subalgebra X of A and an element p X such that the subset X p := {x p: x X} of A coincides with B. Proof. Every block B coincides with B p,wherep is the least element of B. Clearly, B p B; on the other hand, B B p in virtue of (2). Now suppose that X is a subalgebra of A and p X. Thenp is the least element of X p, and this subset is closed under : for all x, y X, x p..y p = z p, where z = x p..y p: p X. Indeed, x p..y p z p by (1) and 12. The reverse inequality follows by (1) from the identity z.x y =1. where x := x p, y := y p, z := z p = x y. p: p : z.x y = x.z y (by 9 ) = x ::x y. p: p y = x.x y :.x p.x p::.x y (by 10 ) = x y..x p:.x p.x y (by 8 ) = x y p. p: y (by 10 ) = x.y y (by 11 ) =1 (by 5, 4 ). Thus, X p is a bounded subalgebra of A. Moreover,since x p..y p:.x p x p. p:.x p (by 1, 7, 6 ) = x x p. p: p (by 9 ) = x p (by 11, 8 ), it is an implication algebra see ( 14 ). Note that if the subalgebra X is even an implication algebra, then, due to (2), X p turns out to be a principal order filter in X: for all x X, p x implies that x = y p with y = x p. It is common knowledge that the (, 1)-reduct of an implicative semilattice is a Hilbert algebra. The converse, which is included in the proposition below, is less wellknown.
5 268 J. Cīrulis / Central European Journal of Mathematics 5(2) Proposition 2.2. An algebra (A,, 1) is a Hilbert algebra if and only if it is a subreduct of an implicative semilattice. Proof. Sufficiency of the condition follows from the above observation. Its necessity is implicit in Theorem 8.5 of [23] (the I-algebras studied there are just the Hilbert algebras). Moreover, as noted by a referee, the proposition is a direct consequence of [14, Theorem 12]. However, we shall discuss some details of the proof from [23], which will be needed below. Let A stand for the set of all finite non-empty subsets of a Hilbert algebra A, every element a of A being identified with its singleton {a}; thena A and (A,, 1) is an idempotent and commutative monoid freely generated by A; it is considered as a lower semilattice with unit. Now, the operation can be extended to A so that K L. M = K.L M, K.L M = K L..K M. It is shown in [23] that such an extension always exists and is defined uniquely (see items therein). The relation on A defined by K L if and only if K L =1 is a preorder; moreover, the relation eq defined by K eq L if and only if K L and L K is even a congruence of the algebra (A,,, 1), and a eq b implies a = b. Therefore, A A /eq, and the Hilbert algebra A turns out to be the subreduct of the quotient algebra A /eq. Finally, it follows from Theorem 7.1 of [23] that the quotient itself is an implicative semilattice. This proposition and its proof have several useful consequences concerning the lattice of implicative filters of a Hilbert algebra. An implicative filter [35] (or just a filter, or a deductive system) of a Hilbert algebra A is a nonempty subset F such that b F whenever a b F for some a F. For instance, any principal order filter [a) :={x: a x} is a filter in this sense. In particular, every implicative filter of A contains 1; sometimes this condition is used in the definition instead of being nonempty. Using the notation introduced in the above proof, the filter [X) generated by a subset X of A is described as follows: [X) ={x: K x for some K A } see[14, 15] or,say,[30, Theorem 6], [35, II.3.5]. Note that [K) [L) if and only if L K. (3) As usual, filters of a Hilbert algebra A make up a complete lattice F(A) w.r.t. set inclusion. The lattice is implicative (i.e., a Heyting algebra; see [14, page42]or [4, Remark
6 J. Cīrulis / Central European Journal of Mathematics 5(2) ]) and algebraic [6, Theorem 2]; its compact elements are just finitely generated filters. We shall need the following well-known property of filters, where stands for the join operation in F(A): x y F if and only if y F [x); (4) see, e.g., [14, Lemma3],[30, Corollary 7] or [4, Corollary 2.5]. Duals of implicative semilattices are called subtractive, or difference, semilattices [13]. Theorem 2.3. The upper semilattice F fin (A) of the compact elements of F(A) is a subtractive semilattice, and the subset of principal filters of A is closed under subtraction. Proof. Since [K) [L) =[K L), the mapping that sends a subset K into the filter [K) is an epimorphism of the semilatice (A, ) onto(f fin (A), ). In virtue of (3), the relation eq is its kernel equivalence; so, the mapping induces an anti-isomorphism f of the lower semilattice A /eq onto F fin (A). This anti-isomorphisms turns the latter algebra into a subtractive semilattice; thus, [K) [L) =[L K). In particular, [a) [b) =[b a), and the set of principal filters is closed under subtraction. We note without proof that this theorem is, in fact, equivalent to the assertion that (4) holds for all finitely generated filters. Corollary 2.4. A lattice is isomorphic to the lattice of filters of a Hilbert algebra if and only if it is isomorphic to the lattice of filters of an implicative semilattice. Proof. Sufficiency of the condition is trivial, as every implicative semilattice is a Hilbert algebra. Its necessity follows from Theorem 3.1 of [34], where a complete lattice L which has a compact base that is a subtractive subsemilattice of L is shown to be isomorphic to the lattice of filters of the dual of the base. 3 Compatible meets in a Hilbert algebra Assume that A is a Hilbert algebra, and let ab stand for the meet of elements a and b of A, when it exists. If this is indeed the case, then the following conditions on a and b are equivalent (see [30, Theorem 3]): C1: a ab = a b, C2: a b ab, C3: ab x = a.b x for all x, C4: for all x, (x a)(x b) exists and is equal to x ab, C5: for all x, ab x a b x. Following [30], the elements a and b are said to be compatible (in symbols, acb), if their meet exists and satisfies the first, hence, any of the listed conditions. For example, comparable elements are always compatible. It follows from C2 that in a pure Hilbert algebra only comparable elements are compatible. Thus, a Hilbert algebra is pure if and
7 270 J. Cīrulis / Central European Journal of Mathematics 5(2) only if compatibility in it coincides with comparability. Compatibility can be characterized without explicitly referring to meets: acbif and only if min{x: a b x} exists, (5) and then the minimum is the meet of a and b. Equivalently, acbif and only if there is z such that z a, z b and a b z; (6) again, such z is uniquely determined and serves as the meet. Indeed, if acb,thenc5 shows that ab is the minimum required in (5). Furthermore, if z is the minimum, then z a, z b (see 1,resp., 5 ) and, for every x, a b x implies z x; thus,the condition at the right hand side of (6) is fulfilled. Finally, if z fulfills the condition, then it is even the greatest lower bound of a and b: by 9, 8 and (1), a b x z b x b z x z z x z x. Now acbby C2. Due to 1 and 11, the relationship (x y) C (x y. y), (7) which holds for all x and y, is a self-evident illustration to (6), with y in the role of z. Note that x y. y is the complement of x y in the block A y ;so,(7) is covered by the following more general lemma. Lemma 3.1. Any two elements of a block are compatible, and their meet in A coincides with their meet in the block. Proof. Let B be a block in A, andletp be its least element. Suppose that a, b B and that c is the meet of a and b in B, i.e. c = a.b p: p. Of course, c is a lower bound of a and b also in A. Furthermore, by 9, a.b c = a a.b p:.b p = a.b p: :a.b p =1, wherefrom a b c by (1). Now (6) applies; so acb,andc is the meet of a and b. Theorem 8 of [30] contains the following characteristic of compatible elements in a Hilbert algebra in terms of filters: acbif and only if [a) [b) is a principal filter. More exactly, [a) [b) =[c) if and only if acband ab = c. (8) Note that this characteristic explicitly refers only to the order structure of the algebra under consideration. There are good reasons for considering only meets of compatible elements of a Hilbert algebra as genuine meets. We define the partial operation (called compatible meet) on a Hilbert algebra as follows: a b := min{x: a b x}. (9)
8 J. Cīrulis / Central European Journal of Mathematics 5(2) By (5), a b exists if and only if acb. Notice that in a relatively pseudocomplemented Hilbert algebra A all existing meets are compatible. Indeed, if ab exists in A, thenb ab is the maximum element in {x: z b, z x imply z ab for all z}. Clearly, a belongs to this set, and then acbby C2. On the other hand, the pure three-element Hilbert algebra with two atoms is not relatively pseudocomplemented in spite of the fact that it has only compatible meets (see above). In [22], Hilbert algebras in which the operation is total were termed (H)-Hilbert algebras. According to Theorem 5(i) of [30], such an algebra is even an implicative semilattice (in the dual form this was rediscovered in Sect. 3 of [29]); moreover, every implicative semilattice arises in this way. Of course, ab may exist even when a b does not. By the way, Hilbert algebras having the meet of every pair of elements have been called Hertz algebras by some authors. In [5, Remark 1.3] an equational axiom system for Hertz algebras is credited to A. Monteiro and H. Porta; these axioms were quoted in [25, 29],andusedin[29] to prove that a Hertz algebra is a (H)-Hilbert algebra. The system of axioms goes back to Monteiro, indeed; however, it was intended to describe the class of implicative semilattices (i.e. (H)-Hilbert algebras!) see [32] or[13, Exercise 4.C.8]. Therefore, the mentioned result of [29] (Lemma 1 therein) is formally wrong; cf. [10]. For the same reason, Lemma 1.6 and Theorem 2.9 of [25], as well as most results in [5] concerning Hertz algebras are not quite correct: they should be ascribed to implicative semilattices. Actually, use of the term Hertz algebra in the mentioned sense is a misunderstanding see[17] for its history (the term is, in fact, just another name for implicative semilattices) and for respective improvements to [5, 25, 29]. Hilbert semilattices, i.e. Hilbert algebras in which all the meets ab exist, have recently been studied in [16]. By the way, several results of [30, 31] are rediscovered there. Lemma 3.3 below illustrates the role of compatible meets in a Hilbert algebra. A semilattice filter of a Hilbert algebra A is defined to be a nonempty upwards closed subset F that is closed also under existing meets of compatible elements. It follows from C2 that every implicative filter of A is a semilattice filter. Conversely, suppose that F is a semilattice filter and that x F, x y F for some x, y A. Then also x y. y F (see 12 ). It is easily seen that y is the compatible meet of the elements x y and x y. y (cf. (7)); hence, y F.Thus,F is also an implicative filter, and we have proved Lemma 3.2. A subset of a Hilbert algebra is an implicative filter if and only if it is a semilattice filter. It is worthwhile to note that, in virtue of (6), every homomorphism h between Hilbert algebras preserves compatible meets in the following sense: if acb, then ha C hb and h(a b) =ha hb. (10) Lemma 3.3. If a Hilbert algebra A is a subreduct of an implicative semilattice B, then,
9 272 J. Cīrulis / Central European Journal of Mathematics 5(2) for all x, y, z A, z is the compatible meet of x and y in A if and only if it is the meet of x and y in B. Proof. Suppose that x, y A. Ifz is the meet of x and y in B, thenz x, z y and x y z. Therefore, if z A, thenz is the compatible meet of x and y in A by (6). If, conversely, z x, z y and x y z for some z in A, then, in B, z xy z (for z is the meet of x and y in the subset A). So, z is the greatest lower bound of x and y not only in A, but also in B. Any Hilbert algebra may be treated as a partial semilattice w.r.t. the operation. Let us give a precise meaning to this observation. First, we adapt to semilattices a term used in [18] for lattices. Definition 3.4. A structure (A, ) where is a partial binary operation on A, is called a (lower) weak partial semilattice, or a wp-semilattice, for short, if it satisfies the axioms 1 : x x exists and x x = x, 2 : if x y exists, then y x exists and x y = y x, 3 : if x y. z and y z exist, then x.y z exists and x y. z = x.y z. An element 1 is said to be a unit in A if, for all x A, 4 : x 1 exists and equals to x. The other, symmetric to 3, associative law can be obtained as a consequence: if x.y z and x y exist, then y x exists and x.y z = y z. x = z y. x = z.y x = y x. z = x y. z. Suppose that A is a wp-semilattice. Let acbnow mean that a b exists; then the relation defined by a b if and only if acband a b = a is a partial order on A (with 1 the greatest element), and the element a b, whenever it exists, is the greatest lower bound (i.e., meet) of a and b ([18, Lemma I.5.16]). We again shall refer to the meets of this kind as compatible. A dual ideal, or a filter, in A is a non-empty upper-subset F of A closed under existing compatible meets. Any principal order filter [a) :={x: a x} is also a filter in this sense. As usual, if A has the unit element, then the filters of A form a complete lattice F(A) with respect to the inclusion ; however, we shall deal only with the upper semilattice (F fin (A), ) ofthose filters generated by a finite subset of A: standard considerations show that F fin (A) isthe compact basis of F(A). The wp-semilattice A is said to satisfy the condition D (see [18, p. 42]) if [a) [b) =[c) implies acb; of course, a b = c in this case. In fact, the following strengthening of the implication holds (cf. (8)): [a) [b) =[c) if and only if acband a b = c. (11)
10 J. Cīrulis / Central European Journal of Mathematics 5(2) Proposition 3.5. If a wp-semilattice A with unit satisfies the condition D, then the mapping a [a) is an embedding of A into the dual semilattice of F fin (A). The next definition again is adapted from [18]. Definition 3.6. A partial semilattice is a relative subalgebra of some meet semilattice L, i.e. a subset A of L with the meet operation restricted to A: for all x, y A, anelement z of A is the compatible meet of x and y in A if and only if it is the meet of x and y in L. We shall also speak of A as a relative subsemilattice of L in this case. Every partial semilattice is weakly partial. A full characteristic of partial semilattices follows from the above proposition (cf. [18, Theorem I.5.20]). Proposition 3.7. Partial semilattices are just those wp-semilattices which satisfy the condition D. Note that the partial semilattices of [8] are a more specialized notion: they coincide with the wp-semilattices (in fact, posets) having the lower bound property (or, equivalently, the property that every principal filter is a total meet semilattice). The duals of such algebras were called (upper) nearsemilattices in [9]. We adopt this term here, and call a lower nearsemilattice any wp-semilattice having the lower bound property. For example, every implication algebra is a lower nearsemilattice (see Subsect. 2.1). Notice in connection with the condition D that the lower bound property in a wp-semilattice means the following: [a) [b) [c) implies acb. Now we have achieved the aim set at the beginning of this subsection. Theorem 3.8. The operation (9) on a Hilbert algebra turns the latter into a partial semilattice with the same induced ordering, filters, and compatibility relation. Proof. Assume that A is a Hilbert algebra, and let be the operation on A defined by (9). According to Proposition 2.2, A is a subreduct of an implicative semilattice. Then (A, ) is a partial semilattice by Lemma 3.3. Clearly, the ordering induced by, coincides with the initial ordering of A. By (5), elements a and b are compatible in the partial semilattice if and only if they are compatible in the initial Hilbert algebra. At last, by Lemma 3.2, a subset of A is a filter of the partial semilattice if and only if it is a filter of the Hilbert algebra. Let us call the partial semilattice arising in a Hilbert algebra A this way the -reduct of A. Theorem 3.9. A partial semilattice (A, ) is the -reduct of a Hilbert algebra (A,, 1) if and only if both algebras have the same filters.
11 274 J. Cīrulis / Central European Journal of Mathematics 5(2) Proof. The condition is necessary in virtue of Theorem 3.8. Its sufficiency follows from (8) and(11). Consequently, partial semilattices that are -reducts of a Hilbert algebra can be characterized in terms of their filters: see Theorem Implicative partial semilattices We are now in position to show that a Hilbert algebra is, in fact, a kind of an implicative partial semilattice. The definition below is patterned after Definition 3.6. Definition 4.1. An implicative partial semilattice, or ip-semilattice,for short,is a relative subsemilattice of an implicative semilattice that is closed under implication. In more detail, an ip-semilattice is an algebra (A,,, 1) satisfying the following conditions: (1) (A,, 1) is a partial semilattice with unit, (2) is a total binary operation on A, and (3) there is an implicative semilattice (B,, 1) such that (A, ) is a relative subsemilattice (B, ), and (A,, 1) is a subalgebra of (B,, 1). If it is the case, we call the operation an implication on the partial semilattice A. Applying this notion, Proposition 2.2 can be improved as follows. Theorem 4.2. Every Hilbert algebra, considered as an algebra (A,,, 1) with the compatible meet operation, is an implicative partial semilattice, and conversely. Proof. Suppose that the Hilbert algebra (A,, 1) is a subreduct of an implicative semilattice B. By Lemma 3.3, the -subreduct of A is also a relative subsemilattice of B, and we have arrived at the first assertion of the theorem. Conversely, every relative subsemilattice A of an implicative semilattice B, if closed under implication, determines a (, 1)-subreduct of B that is a Hilbert algebra, while the relativised meet operation of B becomes, according to Lemma 3.3, the compatible meet of A. The implication in an ip-semilattice can also be characterised directly by explicit axioms. Theorem 4.3. Suppose that (A,, 1) is a partial semilattice with unit. A binary operation on A is an implication if and only if it satisfies the conditions i1: if xcy,thenx y z x y z, i2: if x y z, theny x z, i3: if z x, z y and x y z, thenxcy,
12 J. Cīrulis / Central European Journal of Mathematics 5(2) i4: if xcythen, for all u, (u x) C (u y) and u x..u y = u.x y. Proof. If A is an ip-semilattice, then, by the previous theorem, we may consider it as a Hilbert algebra. By C5, 9,(1)and(6), it is evident that i1-i3 hold in A. Toprovei4, also C2 and C4 are needed: if xcy,thenx y xy,wherefromu x u y..u xy by 7 and 2 and, furthermore, u xcu y. Now assume that the operation satisfies i1 i4; let us first see, why then (A,, 1) is a Hilbert algebra. Clearly, xc1; so 1 y z if and only if y z (see i1), as needed for (1). Also, 1 holds in A: due to (1), y 1=x x, andthen 1 follows by i2. It remains to prove 2. At first, we shall obtain 6 and 7.Byi2, y y z. z. (12) Then x y implies that x y z. z, and 6 follows by i2. Furthermore, in virtue of 1 y x y and y x y. y; now i3 and i1 yield the inequality x y. y:.x y y. Hence, by i1, (12) andi2, y z x y. y:.x y z x y. y x y. z x x y. z x y x z, andwehaveobtained 7,too. Now we proceed as follows: (a) x y x :y z. z [(12), 7 ] (b) x :y z. z.x z x y..x z [(a), 6 ] (c) z y z. z [ 1 ] (d) z y z [ 1 ] (e) y zcy z. z [(c),(d),i3] (f) y z. :y z. z z [(e),i1] (g) y z. :y z. z = z [(c),(d),(f)] (h) x.y zcx :y z. z [(e),i4] (i) x.y z : x :y z. z = x z [(g),(h),i4] (j) x.y z x :y z. z.x z [(h),(i),i1] (k) x.y z x y..x z ; [(j),(b)] therefore, 2 holds. Thus, A is a Hilbert algebra, indeed. Recall that then it has the same compatibility relation as the underlying partial semilattice (Lemma 3.2). To complete the proof, we, in view of Theorem 4.2, have to check that the operation obeys (9). It follows (by i1) from the assumption xcythat x y x y and that x y z implies x y z; therefore, if xcy, then x y =min{z : x y z}.
13 276 J. Cīrulis / Central European Journal of Mathematics 5(2) Conversely, if z 0 is the least element in {z : x y z}, thenz 0 x (by 1 ), z 0 y (by 5 and 3 )andx y z 0. Henceforth, xcyby i3; moreover,x y = z 0 see also i1. Thus,(9) holds. In Sect. 3, lower nearsemilattices, a particular kind of wp-semilattices, were mentioned. In such a wp-semilattice, xcyif and only if x and y have a common lower bound. Definition 4.4. A lower nearsemilattice with unit and a binary operation satisfying i1 and i2 is said to be implicative (or an in-semilattice, for short). The implicative nearsemilattices, which are just the duals of subtractive nearsemilattices studied in [9], can be characterized also as implicative partial semilattices having the lower bound property. Indeed, it is easily seen that both the condition i3 and the first half of i4 are immediate consequences of the lower bound property in an in-semilattice (note that i2 provides the inequalities x u x and y u y). According to Theorem 14 of [9], the (, 1)-reduct of an in-semilattice is a Hilbert algebra. Hence, i4 actually holds in any in-semilattice in full by virtue of C4. Our aim in the remainder of the section is to characterize implication operations on partial semilattices alternatively in terms of filters. Theorem 4.5. Suppose that (A,, 1) is a partial semilattice with unit and that is a binary operation on A. Then is an implication on A if and only if it satisfies the condition i5: [y z) F [z) F [y) for every finitely generated filter F of A. Proof. Necessity of the condition follows from Theorem 4.2 and (4). To prove its sufficiency, the following particular case of i5 will be useful: i6: [y z) [x) if and only if [z) [x) [y). It can also be rewritten as x y z if and only if z [x) [y). (13) If xcy,then[x) [y) =[x y) by(11); so i1 is included in (13). Also i2 is an immediate consequence of (13). To prove i3, notethatz x and z y imply [x) [y) [z), while x y z implies [z) [x) [y) (again, by (13)). Due to the condition (D), xcyas needed. To prove i4, we first observe that, for any a, b A, [a) [a b) =[a) [b). (14) Indeed, [a) [a) [b) and, by i6, [a b) [b) [a) [b). Conversely, [a) [a) [a b), and [b) [a b) [a) =[a) [a b) again by i6. Now let xcy. It follows that [x) [y) =[z), where z stands for x y. Then [z) [x) [y) [u) =[u x) [u y) [u)
14 J. Cīrulis / Central European Journal of Mathematics 5(2) by (14) and, furthermore, [u z) [u x) [u y) byi5. On the other hand, [x) [z) [z) [u), wherefrom [u x) [u z) byi6; likewise, [u y) [u z). Therefore, [u x) [u y) =[u z), and i4 now follows from Condition D. It follows from the proof that i5 is equivalent to the conjunction of (13) and i4. Moreover, it is sufficient to consider i5 only for filters F generated by sets with not more than two elements. Furthermore, implication on a partial semilattice is uniquely defined: owing to (13), a b =max{x: b [x) [a)} =max{x: [b) [x) [a)}. In particular, this observation settles the similar uniqueness problem for subtraction in upper nearsemilattices posed in [9]. In virtue of Theorems 3.8 and 4.2, the above uniqueness result can be given another form. Theorem 4.6. Every Hilbert algebra is completely determined by its -reduct. In other words, this means that the structure of a Hilbert algebra can be specified in terms of its ordering and compatibility relations alone. Acknowledgment This work was supported by Latvian Council of Science, Grant Nr The author is grateful to the anonymous referees, whose remarks helped to improve the presentation. References [1] J.C. Abbott: Semi-boolean algebra, Matem. Vestnik N. Ser., Vol. 4(19), (1967), pp [2] J.C. Abbott: Implication algebra, Bull.Math.Soc.Sci.Math.R.S.Roumanie, Vol. 11, (1967), pp [3] J. Berman and W.J. Block: Free Lukasiewicz and hoop residuation algebras, Studia Logica, Vol. 68, (2001), pp [4] D. Busneag: A note on deductive systems of a Hilbert algebra, Kobe J. Math., Vol. 2, (1985), pp [5] D. Busneag: Hertz algebras of fractions and maximal Hertz algebras of quotients, Math. Japon., Vol. 39, (1993), pp [6] I. Chajda: The lattice of deductive systems on Hilbert algebras, Southeast Asian Bull. Math., Vol. 26, (2002), pp [7] I. Chajda and R. Halaš: Order algebras, Demonstr. Math., Vol. 35, (2002), pp [8] I. Chajda and Z. Seidl: An algebraich approach to partial lattices, Demonstr. Math. Vol. 30, (1997), pp
15 278 J. Cīrulis / Central European Journal of Mathematics 5(2) [9] J. Cīrulis: Subtractive nearsemilattices, Proc. Latvian Acad. Sci., Vol. 52B, (1998), pp [10] J. Cīrulis: (H)-Hilbert algebras are not same as Hertz algebras, Bull. Sect. Log. (Lódź), Vol. 32, (2003), pp [11] J. Cīrulis: Hilbert algebras as implicative partial semilattices, Abstracts of AAA- 67, Potsdam, (2004), [12] J. Cīrulis: Multipliers, closure endomorphisms and quasi-decompositions of a Hilbert algebra, Contrib. Gen. Algebra, Vol. 16, (2005), pp [13] H.B. Curry: Foundations of Mathematical Logic, McGraw-Hill, New York e.a., [14] A. Diego: Sobre Algebras de Hilbert, Notas de Logica Mat., Vol. 12, Inst. Mat. Univ. Nac. del Sur, Bahia Blanca, [15] A. Diego: Les Algèbres de Hilbert, Collect. de Logique Math., Sér A, Vol., 21, Gauthier-Willar, Paris, [16] A.V. Figallo, G. Ramón and S. Saad: A note on Hilbert algebras with infimum, Mat. Contemp., Vol. 24, (2003), pp [17] A. Figallo, Jr. and A. Ziliani: Remarks on Hertz algebras and implicative semilattices, Bull. Sect. Logic ( Lódź), Vol. 24, 2005, pp [18] G. Grätzer: General Lattice Theory, Akademie-Verlag, Berlin, [19] R. Halaš: Pseudocomplemented ordered sets, Arch. Math. (Brno), Vol. 29, (1993), pp [20] R. Halaš: Remarks on commutative Hilbert algebras, Math. Bohemica, Vol. 127, (2002), pp [21] L. Henkin: An algebraic characterization of quantifiers, Fund. Math., Vol. 37, (1950), pp [22] S.M. Hong and Y.B. Jun: On a special class of Hilbert algebras, Algebra Colloq., Vol. 3, (1996), pp [23] A. Horn: The separation theorem of intuitionistic propositional calculus, J. Symb. Logic, Vol. 27, (1962), pp [24] K. Iseki and S. Tanaka: An introduction in the theory of BCK-algebras, Math. Japon., Vol. 23, (1978), pp [25] Y.B. Jun: Deductive systems of Hilbert algebras, Math. Japon., Vol. 42, (1996), pp [26] Y.B. Jun: Commutative Hilbert algebras, Soochow J. Math., Vol. 22, (1996), pp [27] T. Katri nák: Pseudokomplementäre Halbverbande, Mat. Časopis, Vol. 18, (1968), pp [28] M. Kondo: Hilbert algebras are dual isomorphic to positive implicative BCKalgebras, Math. Japon., Vol. 49, (1999), pp [29] M. Kondo: (H)-Hilbert algebras are same as Hertz algebras, Math. Japon., Vol. 50, (1999), pp [30] E.L. Marsden: Compatible elements in implicative models, J. Philos. Logic, Vol. 1, (1972), pp
16 J. Cīrulis / Central European Journal of Mathematics 5(2) [31] E.L. Marsden: A note on implicative models, Notre Dame J. Formal Log., Vol. 14, (1973), pp [32] A. Monteiro: Axiomes independants pour les algèbres de Brouwer, Rev. Un. Mat. Argentina, Vol. 17, (1955), pp [33] Y.S. Pawar: Implicative posets, Bull. Calcutta Math. Soc., Vol. 85, (1993), pp [34] W.C. Nemitz: On the lattice of filters of an implicative semi-lattice, J. Math. Mech., Vol. 18, (1969), pp [35] H. Rasiowa: An Algebraic Approach to Non-classical Logics, PWN, North-Holland, Warszawa, [36] S. Rudeanu: On relatively pseudocomplemented posets and Hilbert algebras, An. Stiint. Univ. Iaşi, N. Ser., Ia, Suppl., Vol. 31, (1985), pp [37] A. Torrens: On the role of the polynomial (X Y ) Y in some implicative algebras, Zeitschr. Log. Grundl. Math., Vol. 34, (1988), pp
Mathematica Bohemica
Mathematica Bohemica Radomír Halaš Remarks on commutative Hilbert algebras Mathematica Bohemica, Vol. 127 (2002), No. 4, 525--529 Persistent URL: http://dml.cz/dmlcz/133956 Terms of use: Institute of Mathematics
More informationRESIDUATION SUBREDUCTS OF POCRIGS
Bulletin of the Section of Logic Volume 39:1/2 (2010), pp. 11 16 Jānis Cīrulis RESIDUATION SUBREDUCTS OF POCRIGS Abstract A pocrig (A,,, 1) is a partially ordered commutative residuated integral groupoid.
More informationSIMPLE LOGICS FOR BASIC ALGEBRAS
Bulletin of the Section of Logic Volume 44:3/4 (2015), pp. 95 110 http://dx.doi.org/10.18778/0138-0680.44.3.4.01 Jānis Cīrulis SIMPLE LOGICS FOR BASIC ALGEBRAS Abstract An MV-algebra is an algebra (A,,,
More informationDUAL BCK-ALGEBRA AND MV-ALGEBRA. Kyung Ho Kim and Yong Ho Yon. Received March 23, 2007
Scientiae Mathematicae Japonicae Online, e-2007, 393 399 393 DUAL BCK-ALGEBRA AND MV-ALGEBRA Kyung Ho Kim and Yong Ho Yon Received March 23, 2007 Abstract. The aim of this paper is to study the properties
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationCONTRIBUTIONS TO GENERAL ALGEBRA 19
33 CONTRIBUTIONS TO GENERAL ALGEBRA 19 Proceedings of the Olomouc Conference 2010 (AAA 79 + CYA 25) Verlag Johannes Heyn, Klagenfurt 2010 SKEW NEARLATTICES: SOME STRUCTURE AND REPRESENTATION THEOREMS JĀNIS
More informationORTHOPOSETS WITH QUANTIFIERS
Bulletin of the Section of Logic Volume 41:1/2 (2012), pp. 1 12 Jānis Cīrulis ORTHOPOSETS WITH QUANTIFIERS Abstract A quantifier on an orthoposet is a closure operator whose range is closed under orthocomplementation
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationLukasiewicz Implication Prealgebras
Annals of the University of Craiova, Mathematics and Computer Science Series Volume 44(1), 2017, Pages 115 125 ISSN: 1223-6934 Lukasiewicz Implication Prealgebras Aldo V. Figallo and Gustavo Pelaitay Abstract.
More informationON THREE-VALUED MOISIL ALGEBRAS. Manuel ARAD and Luiz MONTEIRO
ON THREE-VALUED MOISIL ALGEBRAS Manuel ARAD and Luiz MONTEIRO In this paper we investigate the properties of the family I(A) of all intervals of the form [x, x] with x x, in a De Morgan algebra A, and
More informationProperties of Boolean Algebras
Phillip James Swansea University December 15, 2008 Plan For Today Boolean Algebras and Order..... Brief Re-cap Order A Boolean algebra is a set A together with the distinguished elements 0 and 1, the binary
More informationRINGS IN POST ALGEBRAS. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXVI, 2(2007), pp. 263 272 263 RINGS IN POST ALGEBRAS S. RUDEANU Abstract. Serfati [7] defined a ring structure on every Post algebra. In this paper we determine all the
More informationMathematica Bohemica
Mathematica Bohemica Vinayak V. Joshi; B. N. Waphare Characterizations of 0-distributive posets Mathematica Bohemica, Vol. 130 (2005), No. 1, 73 80 Persistent URL: http://dml.cz/dmlcz/134222 Terms of use:
More informationIMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS
Scientiae Mathematicae Japonicae Online, Vol. 8, (2003), 597 606 597 IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS R. J. BIGNALL AND M. SPINKS Received April 1, 2003 Abstract. The variety
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationThe Hermitian part of a Rickart involution ring, I
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 18, Number 1, June 2014 Available online at http://acutm.math.ut.ee The Hermitian part of a Rickart involution ring, I Jānis Cīrulis
More informationOn the filter theory of residuated lattices
On the filter theory of residuated lattices Jiří Rachůnek and Dana Šalounová Palacký University in Olomouc VŠB Technical University of Ostrava Czech Republic Orange, August 5, 2013 J. Rachůnek, D. Šalounová
More informationINJECTIVE DE MORGAN AND KLEENE ALGEBRAS1
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 47, Number 2, February 1975 INJECTIVE DE MORGAN AND KLEENE ALGEBRAS1 ROBERTO CIGNOLI ABSTRACT. The aim of this paper is to characterize the injective
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationarxiv: v2 [math.lo] 12 May 2013
arxiv:1304.6776v2 [math.lo] 12 May 2013 Several characterizations of the 4 valued modal algebras Aldo V. Figallo and Paolo Landini Abstract A. Monteiro, in 1978, defined the algebras he named tetravalent
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationThe Blok-Ferreirim theorem for normal GBL-algebras and its application
The Blok-Ferreirim theorem for normal GBL-algebras and its application Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics
More informationSPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM
SPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM SERGIO A. CELANI AND MARÍA ESTEBAN Abstract. Distributive Hilbert Algebras with infimum, or DH -algebras, are algebras with implication
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationMV -ALGEBRAS ARE CATEGORICALLY EQUIVALENT TO A CLASS OF DRl 1(i) -SEMIGROUPS. (Received August 27, 1997)
123 (1998) MATHEMATICA BOHEMICA No. 4, 437 441 MV -ALGEBRAS ARE CATEGORICALLY EQUIVALENT TO A CLASS OF DRl 1(i) -SEMIGROUPS Jiří Rachůnek, Olomouc (Received August 27, 1997) Abstract. In the paper it is
More informationANNIHILATOR IDEALS IN ALMOST SEMILATTICE
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 339-352 DOI: 10.7251/BIMVI1702339R Former BULLETIN
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationON THE CONGRUENCE LATTICE OF A FRAME
PACIFIC JOURNAL OF MATHEMATICS Vol. 130, No. 2,1987 ON THE CONGRUENCE LATTICE OF A FRAME B. BANASCHEWSKI, J. L. FRITH AND C. R. A. GILMOUR Recall that the Skula modification SkX of a topological space
More informationarxiv: v1 [math.ra] 25 May 2013
Quasigroups and Related Systems 20 (2012), 203 209 Congruences on completely inverse AG -groupoids Wieslaw A. Dudek and Roman S. Gigoń arxiv:1305.6858v1 [math.ra] 25 May 2013 Abstract. By a completely
More informationEmbedding theorems for normal divisible residuated lattices
Embedding theorems for normal divisible residuated lattices Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics and Computer
More informationARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), M. Sambasiva Rao
ARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), 97 105 δ-ideals IN PSEUDO-COMPLEMENTED DISTRIBUTIVE LATTICES M. Sambasiva Rao Abstract. The concept of δ-ideals is introduced in a pseudo-complemented distributive
More informationBG/BF 1 /B/BM-algebras are congruence permutable
Mathematica Aeterna, Vol. 5, 2015, no. 2, 351-35 BG/BF 1 /B/BM-algebras are congruence permutable Andrzej Walendziak Institute of Mathematics and Physics Siedlce University, 3 Maja 54, 08-110 Siedlce,
More informationUNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS
Bulletin of the Section of Logic Volume 32:1/2 (2003), pp. 19 26 Wojciech Dzik UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS Abstract It is shown that all extensions of S5 modal logic, both
More informationSTRONGLY EXTENSIONAL HOMOMORPHISM OF IMPLICATIVE SEMIGROUPS WITH APARTNESS
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 155 162 DOI: 10.5644/SJM.13.2.03 STRONGLY EXTENSIONAL HOMOMORPHISM OF IMPLICATIVE SEMIGROUPS WITH APARTNESS DANIEL ABRAHAM ROMANO Abstract. The
More informationMathematica Bohemica
Mathematica Bohemica A. V. Figallo; Inés Pascual; Alicia Ziliani Notes on monadic n-valued Łukasiewicz algebras Mathematica Bohemica, Vol. 129 (2004), No. 3, 255 271 Persistent URL: http://dml.cz/dmlcz/134149
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationIMPLICATION ALGEBRAS
Discussiones Mathematicae General Algebra and Applications 26 (2006 ) 141 153 IMPLICATION ALGEBRAS Ivan Chajda Department of Algebra and Geometry Palacký University of Olomouc Tomkova 40, 779 00 Olomouc,
More informationON FUZZY TOPOLOGICAL BCC-ALGEBRAS 1
Discussiones Mathematicae General Algebra and Applications 20 (2000 ) 77 86 ON FUZZY TOPOLOGICAL BCC-ALGEBRAS 1 Wies law A. Dudek Institute of Mathematics Technical University Wybrzeże Wyspiańskiego 27,
More informationDOI: /auom An. Şt. Univ. Ovidius Constanţa Vol. 25(1),2017, ON BI-ALGEBRAS
DOI: 10.1515/auom-2017-0014 An. Şt. Univ. Ovidius Constanţa Vol. 25(1),2017, 177 194 ON BI-ALGEBRAS Arsham Borumand Saeid, Hee Sik Kim and Akbar Rezaei Abstract In this paper, we introduce a new algebra,
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationPrime and Irreducible Ideals in Subtraction Algebras
International Mathematical Forum, 3, 2008, no. 10, 457-462 Prime and Irreducible Ideals in Subtraction Algebras Young Bae Jun Department of Mathematics Education Gyeongsang National University, Chinju
More informationOn the Structure of Rough Approximations
On the Structure of Rough Approximations (Extended Abstract) Jouni Järvinen Turku Centre for Computer Science (TUCS) Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland jjarvine@cs.utu.fi Abstract. We study
More informationON STRUCTURE OF KS-SEMIGROUPS
International Mathematical Forum, 1, 2006, no. 2, 67-76 ON STRUCTURE OF KS-SEMIGROUPS Kyung Ho Kim Department of Mathematics Chungju National University Chungju 380-702, Korea ghkim@chungju.ac.kr Abstract
More informationJOIN-COMPLETIONS OF ORDERED ALGEBRAS
JOIN-COMPLETIONS OF ORDERED ALGEBRAS JOSÉ GIL-FÉREZ, LUCA SPADA, CONSTANTINE TSINAKIS, AND HONGJUN ZHOU Abstract. We present a systematic study of join-extensions and joincompletions of ordered algebras,
More informationTopos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationLattices, closure operators, and Galois connections.
125 Chapter 5. Lattices, closure operators, and Galois connections. 5.1. Semilattices and lattices. Many of the partially ordered sets P we have seen have a further valuable property: that for any two
More informationA CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS
Bulletin of the Section of Logic Volume 11:3/4 (1982), pp. 134 138 reedition 2009 [original edition, pp. 134 139] Bogus law Wolniewicz A CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS 1. Preliminaries In [4]
More informationTHE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS
THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. This paper is devoted to the semilattice ordered V-algebras of the form (A, Ω, +), where
More informationFilters on posets and generalizations
Filters on posets and generalizations Victor Porton 78640, Shay Agnon 32-29, Ashkelon, Israel Abstract They are studied in details properties of filters on lattices, filters on posets, and certain generalizations
More informationOn atoms in BCC-algebras
Discussiones Mathematicae ser. Algebra and Stochastic Methods 15 (1995), 81 85 On atoms in BCC-algebras Wies law A. DUDEK and Xiaohong ZHANG Abstract We characterize the the set of all atoms of a BCC-algebra
More informationTRANSITIVE AND ABSORBENT FILTERS OF LATTICE IMPLICATION ALGEBRAS
J. Appl. Math. & Informatics Vol. 32(2014), No. 3-4, pp. 323-330 http://dx.doi.org/10.14317/jami.2014.323 TRANSITIVE AND ABSORBENT FILTERS OF LATTICE IMPLICATION ALGEBRAS M. SAMBASIVA RAO Abstract. The
More informationON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS
Discussiones Mathematicae General Algebra and Applications 35 (2015) 21 31 doi:10.7151/dmgaa.1227 ON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS Grzegorz Dymek Institute of Mathematics and Computer Science
More informationGENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXV, 2(1996), pp. 247 279 247 GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS J. HEDLÍKOVÁ and S. PULMANNOVÁ Abstract. A difference on a poset (P, ) is a partial binary
More informationTense Operators on Basic Algebras
Int J Theor Phys (2011) 50:3737 3749 DOI 10.1007/s10773-011-0748-4 Tense Operators on Basic Algebras M. Botur I. Chajda R. Halaš M. Kolařík Received: 10 November 2010 / Accepted: 2 March 2011 / Published
More informationThe prime spectrum of MV-algebras based on a joint work with A. Di Nola and P. Belluce
The prime spectrum of MV-algebras based on a joint work with A. Di Nola and P. Belluce Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada
More informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationFrom Residuated Lattices to Boolean Algebras with Operators
From Residuated Lattices to Boolean Algebras with Operators Peter Jipsen School of Computational Sciences and Center of Excellence in Computation, Algebra and Topology (CECAT) Chapman University October
More informationarxiv: v1 [math.lo] 20 Oct 2007
ULTRA LI -IDEALS IN LATTICE IMPLICATION ALGEBRAS AND MTL-ALGEBRAS arxiv:0710.3887v1 [math.lo] 20 Oct 2007 Xiaohong Zhang, Ningbo, Keyun Qin, Chengdu, and Wieslaw A. Dudek, Wroclaw Abstract. A mistake concerning
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationON FILTERS IN BE-ALGEBRAS. Biao Long Meng. Received November 30, 2009
Scientiae Mathematicae Japonicae Online, e-2010, 105 111 105 ON FILTERS IN BE-ALGEBRAS Biao Long Meng Received November 30, 2009 Abstract. In this paper we first give a procedure by which we generate a
More informationEQ-ALGEBRAS WITH PSEUDO PRE-VALUATIONS. Yongwei Yang 1. Xiaolong Xin
italian journal of pure and applied mathematics n. 37 2017 (29 48) 29 EQ-ALGEBRAS WITH PSEUDO PRE-VALUATIONS Yongwei Yang 1 School of Mathematics and Statistics Anyang Normal University Anyang 455000 China
More informationThe overlap algebra of regular opens
The overlap algebra of regular opens Francesco Ciraulo Giovanni Sambin Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called overlap. The new notion of overlap
More informationFinite groups determined by an inequality of the orders of their elements
Publ. Math. Debrecen 80/3-4 (2012), 457 463 DOI: 10.5486/PMD.2012.5168 Finite groups determined by an inequality of the orders of their elements By MARIUS TĂRNĂUCEANU (Iaşi) Abstract. In this note we introduce
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationKazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +
REPORTS ON MATHEMATICAL LOGIC 40 (2006), 3 13 Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + A b s t r a c t. In this paper it is proved that the interval
More informationA NOTE ON MULTIPLIERS OF SUBTRACTION ALGEBRAS
Hacettepe Journal of Mathematics and Statistics Volume 42 (2) (2013), 165 171 A NOTE ON MULTIPLIERS OF SUBTRACTION ALGEBRAS Sang Deok Lee and Kyung Ho Kim Received 30 : 01 : 2012 : Accepted 20 : 03 : 2012
More informationThe variety of commutative additively and multiplicatively idempotent semirings
Semigroup Forum (2018) 96:409 415 https://doi.org/10.1007/s00233-017-9905-2 RESEARCH ARTICLE The variety of commutative additively and multiplicatively idempotent semirings Ivan Chajda 1 Helmut Länger
More informationLattice Theory Lecture 5. Completions
Lattice Theory Lecture 5 Completions John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Completions Definition A completion of a poset P
More informationWhen does a semiring become a residuated lattice?
When does a semiring become a residuated lattice? Ivan Chajda and Helmut Länger arxiv:1809.07646v1 [math.ra] 20 Sep 2018 Abstract It is an easy observation that every residuated lattice is in fact a semiring
More informationIntroduction to generalized topological spaces
@ Applied General Topology c Universidad Politécnica de Valencia Volume 12, no. 1, 2011 pp. 49-66 Introduction to generalized topological spaces Irina Zvina Abstract We introduce the notion of generalized
More informationBM-ALGEBRAS AND RELATED TOPICS. 1. Introduction
ao DOI: 10.2478/s12175-014-0259-x Math. Slovaca 64 (2014), No. 5, 1075 1082 BM-ALGEBRAS AND RELATED TOPICS Andrzej Walendziak (Communicated by Jiří Rachůnek ) ABSTRACT. Some connections between BM-algebras
More informationSome consequences of compactness in Lukasiewicz Predicate Logic
Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic
More informationSome Pre-filters in EQ-Algebras
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 12, Issue 2 (December 2017), pp. 1057-1071 Applications and Applied Mathematics: An International Journal (AAM) Some Pre-filters
More informationFinite homogeneous and lattice ordered effect algebras
Finite homogeneous and lattice ordered effect algebras Gejza Jenča Department of Mathematics Faculty of Electrical Engineering and Information Technology Slovak Technical University Ilkovičova 3 812 19
More informationCoupled -structures and its application in BCK/BCI-algebras
IJST (2013) 37A2: 133-140 Iranian Journal of Science & Technology http://www.shirazu.ac.ir/en Coupled -structures its application in BCK/BCI-algebras Young Bae Jun 1, Sun Shin Ahn 2 * D. R. Prince Williams
More informationGeneralized Fuzzy Ideals of BCI-Algebras
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 32(2) (2009), 119 130 Generalized Fuzzy Ideals of BCI-Algebras 1 Jianming Zhan and
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationObstinate filters in residuated lattices
Bull. Math. Soc. Sci. Math. Roumanie Tome 55(103) No. 4, 2012, 413 422 Obstinate filters in residuated lattices by Arsham Borumand Saeid and Manijeh Pourkhatoun Abstract In this paper we introduce the
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More informationActa Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica Ivan Chajda; Radomír Halaš; Josef Zedník Filters and annihilators in implication algebras Acta Universitatis Palackianae
More information8. Distributive Lattices. Every dog must have his day.
8. Distributive Lattices Every dog must have his day. In this chapter and the next we will look at the two most important lattice varieties: distributive and modular lattices. Let us set the context for
More informationOn the lattice of congruence filters of a residuated lattice
Annals of University of Craiova, Math. Comp. Sci. Ser. Volume 33, 2006, Pages 174 188 ISSN: 1223-6934 On the lattice of congruence filters of a residuated lattice Raluca Creţan and Antoaneta Jeflea Abstract.
More informationRelational semantics for a fragment of linear logic
Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.
More informationGiven a lattice L we will note the set of atoms of L by At (L), and with CoAt (L) the set of co-atoms of L.
ACTAS DEL VIII CONGRESO DR. ANTONIO A. R. MONTEIRO (2005), Páginas 25 32 SOME REMARKS ON OCKHAM CONGRUENCES LEONARDO CABRER AND SERGIO CELANI ABSTRACT. In this work we shall describe the lattice of congruences
More informationIDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS
IDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS N. GALATOS AND J.G. RAFTERY Abstract. This paper concerns residuated lattice-ordered idempotent commutative monoids that
More informationz -FILTERS AND RELATED IDEALS IN C(X) Communicated by B. Davvaz
Algebraic Structures and Their Applications Vol. 2 No. 2 ( 2015 ), pp 57-66. z -FILTERS AND RELATED IDEALS IN C(X) R. MOHAMADIAN Communicated by B. Davvaz Abstract. In this article we introduce the concept
More informationSUBALGEBRAS AND HOMOMORPHIC IMAGES OF THE RIEGER-NISHIMURA LATTICE
SUBALGEBRAS AND HOMOMORPHIC IMAGES OF THE RIEGER-NISHIMURA LATTICE Guram Bezhanishvili and Revaz Grigolia Abstract In this note we characterize all subalgebras and homomorphic images of the free cyclic
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationTwo Axioms for Implication Algebras
Notre Dame Journal of Formal Logic Two Axioms for Implication Algebras A. Gareau and R. Padmanabhan Abstract It is well-known that the implicational fragment of the classical propositional calculus has
More informationON SUB-IMPLICATIVE (α, β)-fuzzy IDEALS OF BCH-ALGEBRAS
ON SUB-IMPLICATIVE (α, β)-fuzzy IDEALS OF BCH-ALGEBRAS MUHAMMAD ZULFIQAR Communicated by the former editorial board In this paper, we introduce the concept of sub-implicative (α, β)-fuzzy ideal of BCH-algebra
More informationTHE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS
TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We
More informationBoolean Algebras, Boolean Rings and Stone s Representation Theorem
Boolean Algebras, Boolean Rings and Stone s Representation Theorem Hongtaek Jung December 27, 2017 Abstract This is a part of a supplementary note for a Logic and Set Theory course. The main goal is to
More informationITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N ( ) 631
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 2017 (631 642) 631 n-fold (POSITIVE) IMPLICATIVE FILTERS OF HOOPS Chengfang Luo Xiaolong Xin School of Mathematics Northwest University Xi an 710127
More informationSome properties of residuated lattices
Some properties of residuated lattices Radim Bělohlávek, Ostrava Abstract We investigate some (universal algebraic) properties of residuated lattices algebras which play the role of structures of truth
More informationPseudo-BCK algebras as partial algebras
Pseudo-BCK algebras as partial algebras Thomas Vetterlein Institute for Medical Expert and Knowledge-Based Systems Medical University of Vienna Spitalgasse 23, 1090 Wien, Austria Thomas.Vetterlein@meduniwien.ac.at
More informationOn Homomorphism and Algebra of Functions on BE-algebras
On Homomorphism and Algebra of Functions on BE-algebras Kulajit Pathak 1, Biman Ch. Chetia 2 1. Assistant Professor, Department of Mathematics, B.H. College, Howly, Assam, India, 781316. 2. Principal,
More informationScientiae Mathematicae Japonicae Online, Vol.4 (2001), a&i IDEALS ON IS ALGEBRAS Eun Hwan Roh, Seon Yu Kim and Wook Hwan Shim Abstract. In th
Scientiae Mathematicae Japonicae Online, Vol.4 (2001), 21 25 21 a&i IDEALS ON IS ALGEBRAS Eun Hwan Roh, Seon Yu Kim and Wook Hwan Shim Abstract. In this paper, we introduce the concept of an a&i-ideal
More information