Results 11 to 20 of about 296,040 (177)
The Application of Boolean Algebra in Modelling of Leakage Condition of a Car Hydraulic Braking System [PDF]
International Journal of Applied Mechanics and Engineering, 2013 A general characteristics of a car hydraulic braking system (CHBS) is presented in this publication. A graphical model of properties-component objects is developed for the above-mentioned system.
A. Idzikowski, S. Salamon
doaj +2 more sources
Boolean Algebra of C-Algebras [PDF]
Journal of Mathematical and Fundamental Sciences, 2014 A C- algebra is the algebraic form of the 3-valued conditional logic, which was introduced by F. Guzman and C.C. Squier in 1990. In this paper, some equivalent conditions for a C- algebra to become a boolean algebra in terms of congruences are given.
Guddati C. Rao, Perumali Sundarayya
doaj +2 more sources
On Boolean reliability algebra
CoRR, 2023 In this paper we consider systems which consist of binary components with known reliabilities. We discuss their algebraic properties and define the corresponding algebraic structure, which we call the reliability algebra. We prove that the reliability algebra is a Boolean algebra.
Branislav R. Boricic +2 more
openaire +4 more sources
De Morgan Functions and Free De Morgan Algebras
Demonstratio Mathematica, 2014 It is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone ...
Movsisyan Yu. M. +2 more
doaj +1 more source
Mutually Exclusive Nuances of Truth in Moisil Logic [PDF]
Scientific Annals of Computer Science, 2015 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
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 more
core +1 more source
Regular and Boolean elements in hoops and constructing Boolean algebras using regular filters
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 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
Identities in the Algebra of Partial Maps [PDF]
, 2005 We consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable.
Marcel Jackson +3 more
core +1 more source
Further Complete Solutions to Four Open Problems on Filter of Logical Algebras
International Journal of Computational Intelligence Systems, 2019 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
Monoids with tests and the algebra of possibly non-halting programs [PDF]
, 2015 We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Marcel Jackson +3 more
core +1 more source