Results 61 to 70 of about 1,844 (139)
Hasse Diagrams of Finite Kleene Algebra Having 13 elements [PDF]
, 2000 application/pdfKleene algebra, which is refered to also as fuzzy algebra, is an algebraic system of fuzzy set or fuzzy logic. It is well known that Boolean algebra is one of the most important algebra for engineering, and the ordinary set theory and the ...
Tokumasu, Shinji +5 more
core +1 more source
, 1992 The fact that there is an isomorphism between the matrices over the Boolean algebra of subsets of a k-element set and the k-tuples of Boolean binary [i.e.
Kirkland, Stephen, Pullman, Norman J.
core +1 more source
EMBEDDING OF BOOLEAN ALGEBRA WITHIN THE FRAMEWORK OF BE-ALGEBRA
Boolean algebra constitutes the core foundation of classical mathematical logic, whereas BE-Algebra generalizes the structure of BCK as well as BCI algebras.
Choudhury, Hitesh
core
, 2008 There are two main results concerning the nature of constructive extensions of the countable atomless Boolean algebra, say 28 a, which appear in [1].
G. C. Nelson, E. W. Madison
core
A Boolean algebra of contracts for logical assume-guarantee reasoning
, 2008 Assume-guarantee reasoning is a popular and expressive paradigm for a modular and compositional specification of programs. It is in turn of becoming a fundamental concept in mainstream industrial computer-aided design tools for embedded system design. In
Talpin, Jean-Pierre +3 more
core +2 more sources
, 2011 In recent years, Boolean Gröbner bases have attracted the attention of many researchers, mainly in connection with cryptography. Several sophisticated methods have been developed for the computation of Boolean Gröbner bases.
Inoue, Shutaro +9 more
core +1 more source
Densities of Ultraproducts of Boolean Algebras
, 1995 We answer three problems by J. D. Monk on cardinal invariants of Boolean algebras. Two of these are whether taking the algebraic density πA resp. the topological density cL4 of a Boolean algebra A commutes with formation of ultraproducts; the third one ...
Sabine Koppelberg, Saharon Shelah
core +1 more source
Computability of boolean algebras and their extensions
, 1973 A Boolean algebra is computable if there is a one-to-one enumeration (On)nϵN of its domain which associates recursive functions with sup, inf and complement.
Alton, Donald A., Madison, E.W.
core +1 more source
Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors [PDF]
, 2007 RePEc Working Paper Series No. 02/2007Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors.
Meguire, P.
core
Short Formulations of Boolean Algebra, Using Ring Operations
, 1951 Special interest has recently attached to formulations of Boolean algebra in terms of ring operations [7], [1]. These axiomatizations have not been as brief as those reached through other modes of approach.
Lee Byrne
core +1 more source