Results 131 to 140 of about 47,397 (182)
Some of the next articles are maybe not open access.
Extensions of Free Boolean Algebras
Journal of the London Mathematical Society, 1974T. Cramer
openaire +2 more sources
Bounded Boolean Powers and Free Product of GMV-Algebras
International Journal of Theoretical Physics, 2010 The authors introduce and study an algebraic construction of a bounded Boolean power of GMV-algebras (non-commutative generalizations of MV-algebras). As a consequence, they show that the free product of an MV-algebra and a finite Boolean algebra is an MV-algebra. Moreover, they show that the topological Boolean power is equivalent to the algebraic one.
Anatolij Dvurečenskij, Marek Hyčko
openalex +3 more sources
Counting Complexity of Reachability Problem for Boolean Control Networks with Free Control Sequence
Cybersecurity and Cyberforensics Conference, 2022In this paper, we investigate the counting complexity of reachability problem for Boolean control networks (BCNs) by Boolean counting constraint satisfaction problem (#CSP). We prove that the counting complexity of a class of Boolean #CSP by using Post's
Zhi Li, Hongsheng Qi
semanticscholar +1 more source
The Subalgebra Lattice of A Finite Diagonal-Free Two-Dimensional Cylindric Algebra
Journal of Computacion y Sistemas, 2023. Diagonal–free two–dimensional cylindric algebras ( Df 2 − algebras for short) are Boolean algebras enriched with two existential quantifiers which commute. Df 2 − algebras were introduced by A. Tarski, L. Chin and F.
M. Figallo, Claudia M. Gomes
semanticscholar +1 more source
Disturbance decoupling control design for Boolean control networks: a Boolean algebra approach
IET Control Theory & Applications, 2020The disturbance decoupling problem (DDP) whereby the system outputs become insensitive to exogenous signals or disturbances plays a vital role in systems engineering and biological systems.
K. Sarda, A. Yerudkar, C. D. Vecchio
semanticscholar +1 more source
Notes on Free Monadic Boolean Algebras
Order, 1999The authors provide a new construction of the free monadic Boolean algebra on \(n\) generators. The proof involves numerous lemmas which generalize previous results of \textit{H. Bass} [Proc. Am. Math. Soc. 9, 258-268 (1958; Zbl 0089.01904)].
Monteiro, Luiz F. +3 more
openaire +1 more source
On free subalgebras of complete Boolean algebras
Archiv der Mathematik, 1977 J. Donald Monk
openalex +3 more sources
On functions defined on free Boolean algebras
Proceedings 32nd IEEE International Symposium on Multiple- Valued Logic, 2003We characterize measures on free Boolean algebras and we examine the relationships that exists between measures and binary tables in relational databases. It is shown that these measures are completely defined by their values on positive conjunctions and an algorithm that leads to the construction of measures starting from its values on a positive ...
N. Rosenberg +2 more
openaire +1 more source
Atom-free ideals of constructive boolean algebras
Algebra and Logic, 1984A denumerable structure is said to be recursive if its universe is a recursive subset of the set of natural numbers and its relations and operations are recursive. A structure is said to be recursively presentable if it is isomorphic to a recursive structure. \textit{L. Feiner} [J. Symb.
openaire +2 more sources