{"title":"论部分有序集连接的超直觉命题逻辑","authors":"V. Khomich","doi":"10.1070/IM1992V038N02ABEH002204","DOIUrl":null,"url":null,"abstract":"This paper introduces a new method of representing pseudo-Boolean algebras by implication structures of a special type or by partially ordered sets. This is used to construct four sequences of pseudo-Boolean algebras. Their properties and the properties of the logics prescribed by the sequences are studied. The connection between these logics and the logic consisting of the realizable propositional formulas is established, and a problem posed by Hosoi and Ono is solved.","PeriodicalId":159459,"journal":{"name":"Mathematics of The Ussr-izvestiya","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"ON SUPERINTUITIONISTIC PROPOSITIONAL LOGICS CONNECTED WITH PARTIALLY ORDERED SETS\",\"authors\":\"V. Khomich\",\"doi\":\"10.1070/IM1992V038N02ABEH002204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a new method of representing pseudo-Boolean algebras by implication structures of a special type or by partially ordered sets. This is used to construct four sequences of pseudo-Boolean algebras. Their properties and the properties of the logics prescribed by the sequences are studied. The connection between these logics and the logic consisting of the realizable propositional formulas is established, and a problem posed by Hosoi and Ono is solved.\",\"PeriodicalId\":159459,\"journal\":{\"name\":\"Mathematics of The Ussr-izvestiya\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics of The Ussr-izvestiya\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1070/IM1992V038N02ABEH002204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of The Ussr-izvestiya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1070/IM1992V038N02ABEH002204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ON SUPERINTUITIONISTIC PROPOSITIONAL LOGICS CONNECTED WITH PARTIALLY ORDERED SETS
This paper introduces a new method of representing pseudo-Boolean algebras by implication structures of a special type or by partially ordered sets. This is used to construct four sequences of pseudo-Boolean algebras. Their properties and the properties of the logics prescribed by the sequences are studied. The connection between these logics and the logic consisting of the realizable propositional formulas is established, and a problem posed by Hosoi and Ono is solved.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
