Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 31 for “"Algebra, Boolean"”.
-
Subposets of the boolean algebra
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1994
-
Algorithm for solving a class of pseudo-boolean equations, An
Includes bibliographical references.
-
A transition calculus for Boolean functions
… the dynamic behavior of logic circuits. Boolean partial derivatives are introduced that are more powerful and applicable to a wider class of problems than the Boolean difference. The partial derivatives are used to define a Boolean differential which provides a concise method for …
-
Elements of Boolean Algebra Theory
… this paper is to state a set of postulates for Boolean algebra and show the characteristic theorems derivable from them, and to unify in one paper the more important methods of representing Boolean algebra and show their equivalence.
-
Program analysis with boolean logic solvers
… techniques that are based on satisfiability of Boolean formulas in conjunctive normal form validate designs by forcing bounds on the range of variables of a design. Their primary drawback is that they are limited to designs of relatively low complexity. They translate a design expressed in an …
-
Simplified theory of Boolean functions
A new, intuitive approach to the study of a Boolean function using its set of parities of subfunctions called the parity spectrum is presented. This approach simplifies the classical theory of Boolean difference, and serves to unify and extend a number of previous results on the modulo-2 logic …
-
A partially ordered semigroup of Boolean spaces.
… chapter investigates the class of countable Boolean algebras from which this semigroup arises. The elements of D correspond to the isomorphism classes of the Boolean algebras under consideration. In Chapter 2 we begin the study of the semigroup structure of D. D is axiomatically described by …
-
An Algorithm for multi-output Boolean logic minimization
… absolute minimal solution to the problem of Boolean Logic Minimization in its most generalized form of multi-output function with arbitrary cost criterion. The proposed algorithm is shown to be tighter than the Quine-McCluskey method in its ability to eliminate redundant prime implicants, …
-
Using BDDs for non-classical propositional theorem proving
This thesis investigates a method for determining satisfiability and validity using Binary Decision Diagrams (BDDs) to construct finite (pseudo-)models. The method was originally considered by Pan et al and Marrero. We extend the method to deal with a wide variety of non-classical propositional …
-
Weakly Dense Subsets of Homogeneous Complete Boolean Algebras
… in ZFC, where B is a homogeneous complete Boolean algebra, d(B) is the density, wd(B) is the weak density, and c(B) is the cellularity of B. Chapter II of this dissertation is a general overview of homogeneous complete Boolean algebras. Assuming the existence of a weakly inaccessible …
-
Probabilistic boolean logic, arithmetic and architectures
… I introduce and define probabilistic Boolean logic, whose logical operators are by definition "correct" with a probability 1/2 <= p <= 1. While most of the laws of conventional Boolean logic can be naturally extended to be valid in the probabilistic case, there are a few significant …
Page 1 of 2