Results 21 to 30 of about 5,667 (233)
Mutually Exclusive Nuances of Truth in Moisil Logic [PDF]
Moisil logic, having as algebraic counterpart Łukasiewicz-Moisil algebras, provides an alternative way to reason about vague information based on the following principle: a many-valued event is characterized by a family of Boolean events.
D. Diaconescu, I. Leuștean
doaj +1 more source
Regular and Boolean elements in hoops and constructing Boolean algebras using regular filters
We study hoops in order to give some new characterizations for regular and Boolean elements in hoops and we study the relationship between them. Specially, we prove that any bounded v-hoop is a Stone algebra if and only if MV -center set and Boolean ...
Aaly Kologani M. +2 more
doaj +1 more source
Further Complete Solutions to Four Open Problems on Filter of Logical Algebras
This paper focuses on the investigation of filters of pseudo BCK-algebra and BL-algebra, important and popular generic commutative and non-commutative logical algebras.
Wei Wang, Pengxi Yang, Yang Xu
doaj +1 more source
AbstractStudies of various algebraic structures which can be defined over a Boolean algebra by means of Boolean operations have been made by Bernstein [1, 2], Cunkle [3], Elliott [4], Frink [6, 7], Grätzer [8], Grätzer and Schmidt [9], Rudeanu [10, 11], Vaidyanathaswamy [12], Wiener [13], and others.
C. H. Cunkle, Sergiu Rudeanu
openaire +2 more sources
Let \(\kappa\) be the cofinality of \(2^{\aleph_ 0}\). There exists a Boolean algebra B of cardinality \(\kappa\) with the property that every subset of B of size \(\kappa\) contains two elements a and b such that ...
Robert Bonnet, Saharon Shelah
openaire +2 more sources
Class of Sheffer stroke BCK-algebras
In this paper, Sheffer stroke BCK-algebra is defined and its features are investigated. It is indicated that the axioms of a Sheffer stroke BCK-algebra are independent.
Oner Tahsin +2 more
doaj +1 more source
Interpolative Boolean Networks
Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions.
Vladimir Dobrić +4 more
doaj +1 more source
Logic-based aggregation methods for ranking student applicants [PDF]
In this paper, we present logic-based aggregation models used for ranking student applicants and we compare them with a number of existing aggregation methods, each more complex than the previous one.
Milošević Pavle +4 more
doaj +1 more source
We prove a Theorem about the relationship between the Depth of the ultraproduct of Boolean algebras, divided by an ultrafilter, and the products of the depths of each component. This answers (partly) an open problem of Monk.
Shimon Garti, Saharon Shelah
openaire +3 more sources
Interpolative Boolean algebra based multicriteria routing algorithm [PDF]
In order to improve the quality-of-service of distributed applications, we propose a multi-criteria algorithm based on interpolative Boolean algebra for routing in an overlay network.
Jeremić Marina +2 more
doaj +1 more source

