{"title":"格蕴涵代数的等价定义","authors":"Song Li-xia, Zhang Kun-lun","doi":"10.1109/FITME.2008.90","DOIUrl":null,"url":null,"abstract":"This paper proved that when we have a binary operation rightarrow and a nullary operations rarr on a non-empty set L, if these operations satisfy the four axioms of lattice implication algebra, then (L, rarr, 0) will be a lattice implication algebra. So, when we define lattice implication algebra, we needn't start on a complemented lattice with universal bounds, but we can begin with an algebra of type (2,0).","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"323 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Equivalent Definitions of Lattice Implication Algebra\",\"authors\":\"Song Li-xia, Zhang Kun-lun\",\"doi\":\"10.1109/FITME.2008.90\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proved that when we have a binary operation rightarrow and a nullary operations rarr on a non-empty set L, if these operations satisfy the four axioms of lattice implication algebra, then (L, rarr, 0) will be a lattice implication algebra. So, when we define lattice implication algebra, we needn't start on a complemented lattice with universal bounds, but we can begin with an algebra of type (2,0).\",\"PeriodicalId\":218182,\"journal\":{\"name\":\"2008 International Seminar on Future Information Technology and Management Engineering\",\"volume\":\"323 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Seminar on Future Information Technology and Management Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FITME.2008.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Seminar on Future Information Technology and Management Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FITME.2008.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Equivalent Definitions of Lattice Implication Algebra
This paper proved that when we have a binary operation rightarrow and a nullary operations rarr on a non-empty set L, if these operations satisfy the four axioms of lattice implication algebra, then (L, rarr, 0) will be a lattice implication algebra. So, when we define lattice implication algebra, we needn't start on a complemented lattice with universal bounds, but we can begin with an algebra of type (2,0).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
