From Boolean Algebra to Unified Algebra

Hehner, Eric C.R.
March 2004
Mathematical Intelligencer;Spring2004, Vol. 26 Issue 2, p3
Academic Journal
Provides information on the symbols and notation of boolean algebra. Applications of boolean algebra in programming, circuit design, mathematical proof and reasoning in any domain. Use of boolean algebra as the basic algebra for computer science; History of number algebra; Example of boolean calculation.


Related Articles

  • A Different and Realistic Approach to Inter Base Conversion for Number System. Rawat, Saurabh; Nautiyal, Bhaskar; Sah, Anushree // International Journal of Computer Applications;8/15/2012, Vol. 52, p37 

    A number system (or system of numeration) is a writing system for expressing numbers, that is a mathematical notation for representing numbers of a given set, using digits or other symbols in a consistent manner. It can be seen as the context that allows the symbols "11" to be interpreted as the...

  • Computation of Probability Coefficients using Binary Decision Diagram and their Application in Test Vector Generation. Ashutosh Kumar Singh; Anand Mohan // International Journal of Computer Science & Engineering;2009, Vol. 3 Issue 1, p33 

    This paper deals with efficient computation of probability coefficients which offers computational simplicity as compared to spectral coefficients. It eliminates the need of inner product evaluations in determination of signature of a combinational circuit realizing given Boolean function. The...

  • The Split Domination in Arithmetic Graphs. Rao, K. V. Suryanarayana; Sreenivansan, V. // International Journal of Computer Applications;Sep2011, Vol. 29, p46 

    The paper concentrates on the theory of domination in graphs. The split domination in graphs was introduced by Kulli and Janakirm[5].In this paper; we have investigated some properties of the split domination number of an Arithmetic Graph and obtained several interesting results. The split...

  • Elementary Regular Rings. II. Ershov, Yu. L. // Siberian Mathematical Journal;May/Jun2004, Vol. 45 Issue 3, p459 

    We extend the well-known result by Burris and Werner on existence of defining sequences for elementary products of models to arbitrary enrichments of Boolean algebras (we obtain a complete analog of the Feferman�Vaught theorem). This enables us to establish decidability of the elementary...

  • Bounded algebraic systems and universal functions. Khisamiev, A. // Doklady Mathematics;Apr2010, Vol. 81 Issue 2, p309 

    The article presents a study on conventional computability theory which focuses on computable functions and relations on positive integers. It introduces the concept of ∑-bounded algebraic system which has proven that Boolean algebras, linear order and Ershov algebras are by...

  • Reaping Numbers of Boolean Algebras. Dow, Alan; Steprāns, Juris; Watson, Stephen // Bulletin of the London Mathematical Society;1996, Vol. 28 Issue 6, p591 

    A subset A of a Boolean algebra B is said to be (n,m)-reaped if there is a partition of unity p ⊂ B of size n such that {b ∈ p:b ∧ a ≠ 0} ≥ m for all a ∈ A. The reaping number rn,m (B) of a Boolean algebra B is the minimum cardinality of a set...

  • Compound Sets in Mathematical Programming Modeling Languages. Bisschop, J. J.; Kuip, C. A. C. // Management Science;Jun93, Vol. 39 Issue 6, p746 

    This paper presents a series of simple but realistic examples in which common algebraic indexing conventions are not so convenient. In particular, it analyzes the difficulties caused by the conventions that each model component must have a fixed number of indices and that the order of the...

  • Formal Specification of UML Use Case Diagram - A CASL based approach. Mondal, Bhaswati; Das, Barun; Banerjee, Prasenjit // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 3, p2713 

    Unified Modelling Language (UML) gives a modelling approach to design a system. Use Case diagram is one of the behavioural approach of UML which describe the behavioural pattern of the system. It has been observed that UML diagrams are not formally specified. Formal specification gives a...

  • Formal communication elimination and sequentialization equivalence proofs for distributed system models. Bertran, Miquel; Babot, Francesc; Climent, August // Acta Informatica;Sep2014, Vol. 51 Issue 6, p347 

    Equivalence reasoning with distributed system models, expressed directly as imperative programs with explicit parallelism, communication operations, storage variables and boolean conditions, remains virtually unexplored. Only reasoning with models expressed as process algebras has been amply...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics