The Theory of Propositional Logics in Reference of Boolean Algebra

J. Tiwari, Rajendra Tiwari
{"title":"The Theory of Propositional Logics in Reference of Boolean Algebra","authors":"J. Tiwari, Rajendra Tiwari","doi":"10.5958/2231-0657.2016.00034.3","DOIUrl":null,"url":null,"abstract":"In this article, we will prove that set of complex numbers C = a + ib, where a, b ∈ R and i = imaginary number also known as by iota (i = √-1), is the set of largest number, whereas the set of natural numbers N = {1, 2, 3, …, n, …} is the set of least numbers through logical approach of validity of argument using logic of Boolean algebra and through different algebraic operations. We shall verify through rule of detachment by applying them on identity relation N ⊂ W ⊂ I ⊂ Q ⊂ R ⊂ C or C ⊃ R ⊃ Q ⊃ I ⊃ W ⊃ N. It will be proved by using Boolean algebra table and different Boolean algebraic properties.","PeriodicalId":268303,"journal":{"name":"Siddhant- A Journal of Decision Making","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siddhant- A Journal of Decision Making","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5958/2231-0657.2016.00034.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this article, we will prove that set of complex numbers C = a + ib, where a, b ∈ R and i = imaginary number also known as by iota (i = √-1), is the set of largest number, whereas the set of natural numbers N = {1, 2, 3, …, n, …} is the set of least numbers through logical approach of validity of argument using logic of Boolean algebra and through different algebraic operations. We shall verify through rule of detachment by applying them on identity relation N ⊂ W ⊂ I ⊂ Q ⊂ R ⊂ C or C ⊃ R ⊃ Q ⊃ I ⊃ W ⊃ N. It will be proved by using Boolean algebra table and different Boolean algebraic properties.
布尔代数参考中的命题逻辑理论
本文利用布尔代数的逻辑,通过论证有效性的逻辑方法,通过不同的代数运算,证明了复数集C = a + ib,其中a, b∈R, i =虚数也称为iota (i =√-1)是最大数的集合,而自然数集N ={1,2,3,…,N,…}是最小数的集合。我们将通过分离规则将它们应用于单位关系N∧W∧I∧Q∧R∧C或C、R、Q、I、W、N上进行验证,并利用布尔代数表和不同的布尔代数性质进行证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信