On pseudo-BCI-algebras
The notion of normal pseudo-BCI-algebras is studied and some characterizations of it are given. Extensions of pseudo-BCI-algebras are also considered.
On ()-fuzzy filters of pseudo-BL algebras.
On quantic conuclei in orthomodular lattices.
On representations of logics
On Reproductive Solutions Of Arbitrary Equations
On reproductive solutions of arbitrary equations.
On reproductive solutions of Boolean equations.
On some contributions to quantum structures by fuzzy sets
It is well known that the fuzzy sets theory can be successfully used in quantum models ([5, 26]). In this paper we give first a review of recent development in the probability theory on tribes and their generalizations – multivalued (MV)-algebras. Secondly we show some applications of the described method to develop probability theory on IF-events.
On some inexact relations in probabilized Boolean algebras.
This paper is devoted to characterize monotonicity, conditionality and transitivity of some rational relations defined in a probabilized Boolean Algebra.
On some numerical representation of Post algebras
On some properties of Post algebras with countable chain of constants
On some properties of submeasures on MV-algebras
On some properties of transformations of a logic
On Some Relations in Boolean Algebras
On systems of congruences on principal filters of orthomodular implication algebras
Orthomodular implication algebras (with or without compatibility condition) are a natural generalization of Abbott’s implication algebras, an implication reduct of the classical propositional logic. In the paper deductive systems (= congruence kernels) of such algebras are described by means of their restrictions to principal filters having the structure of orthomodular lattices.
On the axiomatisation of Boolean categories with and without medial.
On the Boolean structure generated by -points of
On the concreteness of quantum logics
It is shown that for any quantum logic one can find a concrete logic and a surjective homomorphism from onto such that maps the centre of onto the centre of . Moreover, one can ensure that each finite set of compatible elements in is the image of a compatible subset of . This result is “best possible” - let a logic be the homomorphic image of a concrete logic under a homomorphism such that, if is a finite subset of the pre-image of a compatible subset of , then is compatible....
On the congruences in four-valued modal algebras
On the construction of dense lattices with a given automorphisms group
We consider the problem of constructing dense lattices in with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions , we exhibit a finite set of lattices that come with an automorphisms group of size , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...