Displaying 341 – 360 of 710

Showing per page

On 0 - 1 measure for projectors

Václav Alda (1980)

Aplikace matematiky

An example of a finite set of projectors in E 3 is exhibited for which no 0-1 measure exists.

On a period of elements of pseudo-BCI-algebras

Grzegorz Dymek (2015)

Discussiones Mathematicae - General Algebra and Applications

The notions of a period of an element of a pseudo-BCI-algebra and a periodic pseudo-BCI-algebra are defined. Some of their properties and characterizations are given.

On a periodic part of pseudo-BCI-algebras

Grzegorz Dymek (2015)

Discussiones Mathematicae - General Algebra and Applications

In the paper the connections between the set of some maximal elements of a pseudo-BCI-algebra and deductive systems are established. Using these facts, a periodic part of a pseudo-BCI-algebra is studied.

On annihilators in BL-algebras

Yu Xi Zou, Xiao Long Xin, Peng Fei He (2016)

Open Mathematics

In the paper, we introduce the notion of annihilators in BL-algebras and investigate some related properties of them. We get that the ideal lattice (I(L), ⊆) is pseudo-complemented, and for any ideal I, its pseudo-complement is the annihilator I⊥ of I. Also, we define the An (L) to be the set of all annihilators of L, then we have that (An(L); ⋂,∧An(L),⊥,0, L) is a Boolean algebra. In addition, we introduce the annihilators of a nonempty subset X of L with respect to an ideal I and study some properties...

On BE-semigroups.

Ahn, Sun Shin, Kim, Young Hee (2011)

International Journal of Mathematics and Mathematical Sciences

On Boolean modus ponens.

Sergiu Rudeanu (1998)

Mathware and Soft Computing

An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].

On BPI Restricted to Boolean Algebras of Size Continuum

Eric Hall, Kyriakos Keremedis (2013)

Bulletin of the Polish Academy of Sciences. Mathematics

(i) The statement P(ω) = “every partition of ℝ has size ≤ |ℝ|” is equivalent to the proposition R(ω) = “for every subspace Y of the Tychonoff product 2 ( ω ) the restriction |Y = Y ∩ B: B ∈ of the standard clopen base of 2 ( ω ) to Y has size ≤ |(ω)|”. (ii) In ZF, P(ω) does not imply “every partition of (ω) has a choice set”. (iii) Under P(ω) the following two statements are equivalent: (a) For every Boolean algebra of size ≤ |ℝ| every filter can be extended to an ultrafilter. (b) Every Boolean algebra of...

Currently displaying 341 – 360 of 710