Arithmetic version of boolean algebra

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...

Full description

Bibliographic Details
Main Authors: Azram, Mohammad, Daoud, Jamal Ibrahim, Mohamed Elfaki, Faiz Ahmed
Format: Proceeding Paper
Language:English
Published: 2009
Subjects:
Online Access:http://irep.iium.edu.my/6170/1/05234473.pdf
_version_ 1825644751015116800
author Azram, Mohammad
Daoud, Jamal Ibrahim
Mohamed Elfaki, Faiz Ahmed
author_facet Azram, Mohammad
Daoud, Jamal Ibrahim
Mohamed Elfaki, Faiz Ahmed
author_sort Azram, Mohammad
collection IIUM
description 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.
first_indexed 2024-03-05T22:37:25Z
format Proceeding Paper
id oai:generic.eprints.org:6170
institution International Islamic University Malaysia
language English
last_indexed 2024-03-05T22:37:25Z
publishDate 2009
record_format dspace
spelling oai:generic.eprints.org:61702011-11-22T01:32:11Z http://irep.iium.edu.my/6170/ Arithmetic version of boolean algebra Azram, Mohammad Daoud, Jamal Ibrahim Mohamed Elfaki, Faiz Ahmed QA Mathematics 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. 2009-09 Proceeding Paper PeerReviewed application/pdf en http://irep.iium.edu.my/6170/1/05234473.pdf Azram, Mohammad and Daoud, Jamal Ibrahim and Mohamed Elfaki, Faiz Ahmed (2009) Arithmetic version of boolean algebra. In: 2nd IEEE International Conference on Computer Science and Information Technology (ICCSIT), 8-11 August, 2009, Beijing, China. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5234473
spellingShingle QA Mathematics
Azram, Mohammad
Daoud, Jamal Ibrahim
Mohamed Elfaki, Faiz Ahmed
Arithmetic version of boolean algebra
title Arithmetic version of boolean algebra
title_full Arithmetic version of boolean algebra
title_fullStr Arithmetic version of boolean algebra
title_full_unstemmed Arithmetic version of boolean algebra
title_short Arithmetic version of boolean algebra
title_sort arithmetic version of boolean algebra
topic QA Mathematics
url http://irep.iium.edu.my/6170/1/05234473.pdf
work_keys_str_mv AT azrammohammad arithmeticversionofbooleanalgebra
AT daoudjamalibrahim arithmeticversionofbooleanalgebra
AT mohamedelfakifaizahmed arithmeticversionofbooleanalgebra