{"title":"布尔复逻辑","authors":"K. Suzuki, K. Sugimoto, H. Suzuki","doi":"10.1109/COMCOMAP.2012.6154874","DOIUrl":null,"url":null,"abstract":"This article, by describing atoms and logic formulae with complex functions, defines a new multivalued logic such that the set of logic formulae forms a Boolean algebra in contrast to popular multivalued logics such as fuzzy logics, which we call a Boolean complex logic. This article shows also some intuitively understandable examples demonstrating that the proposed logic can process deductive inferences syntactically by evaluating ranges of truth values.","PeriodicalId":281865,"journal":{"name":"2012 Computing, Communications and Applications Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Boolean complex logic\",\"authors\":\"K. Suzuki, K. Sugimoto, H. Suzuki\",\"doi\":\"10.1109/COMCOMAP.2012.6154874\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article, by describing atoms and logic formulae with complex functions, defines a new multivalued logic such that the set of logic formulae forms a Boolean algebra in contrast to popular multivalued logics such as fuzzy logics, which we call a Boolean complex logic. This article shows also some intuitively understandable examples demonstrating that the proposed logic can process deductive inferences syntactically by evaluating ranges of truth values.\",\"PeriodicalId\":281865,\"journal\":{\"name\":\"2012 Computing, Communications and Applications Conference\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Computing, Communications and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMCOMAP.2012.6154874\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Computing, Communications and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMCOMAP.2012.6154874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This article, by describing atoms and logic formulae with complex functions, defines a new multivalued logic such that the set of logic formulae forms a Boolean algebra in contrast to popular multivalued logics such as fuzzy logics, which we call a Boolean complex logic. This article shows also some intuitively understandable examples demonstrating that the proposed logic can process deductive inferences syntactically by evaluating ranges of truth values.