DocumentCode :
3310072
Title :
Arithmetic version of Boolean algebra
Author :
Azram, M. ; Daoud, J.I. ; Elfaki, F.A.M.
Author_Institution :
Dept. of Sci. in Eng., Int. Islamic Univ., Kuala Lumpur, Malaysia
fYear :
2009
fDate :
8-11 Aug. 2009
Firstpage :
79
Lastpage :
80
Abstract :
In this article we will discuss that the logical results in Boolean algebra can equally be derived with ordinary algebraic operations. We will establish arithmetic versions of the common logical propositions inclusive of Sheffer stroke (Nand connective) and Peirce´s arrow (Nor connective) which are very important to design circuit diagrams. We will present the comparison of some basic logical Boolean expressions and their arithmetic version through the truth tables. Finally we will establish the fundamental logical equivalent propositions via arithmetic versions.
Keywords :
Boolean algebra; arithmetic; Boolean algebra; Nand connective; Peirce arrow; Sheffer stroke; algebraic operations; arithmetic version; design circuit diagrams; logical Boolean expressions; logical equivalent propositions; Arithmetic; Boolean algebra; Circuits; Computer science; Connectors; Logic; Mathematics; Arithmetic Version; Boolean Algebra; Logical equivalent propositions; Sheffer Stroke; Truth Tables;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4519-6
Electronic_ISBN :
978-1-4244-4520-2
Type :
conf
DOI :
10.1109/ICCSIT.2009.5234473
Filename :
5234473
Link To Document :
بازگشت