{"title":"可以模拟经典否定的副一致双重否定","authors":"N. Kamide","doi":"10.1109/ISMVL.2016.12","DOIUrl":null,"url":null,"abstract":"A new classical paraconsistent logic (CP), which is a variant of Nelson's paraconsistent four-valued logic, is introduced as a Gentzen-type sequent calculus. The logic CP can simulate the classical negation in classical logic by paraconsistent double negation in CP. Some theorems for syntactically and semantically embedding CP into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for CP are also shown using these embedding theorems.","PeriodicalId":246194,"journal":{"name":"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Paraconsistent Double Negation That Can Simulate Classical Negation\",\"authors\":\"N. Kamide\",\"doi\":\"10.1109/ISMVL.2016.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new classical paraconsistent logic (CP), which is a variant of Nelson's paraconsistent four-valued logic, is introduced as a Gentzen-type sequent calculus. The logic CP can simulate the classical negation in classical logic by paraconsistent double negation in CP. Some theorems for syntactically and semantically embedding CP into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for CP are also shown using these embedding theorems.\",\"PeriodicalId\":246194,\"journal\":{\"name\":\"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2016.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2016.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Paraconsistent Double Negation That Can Simulate Classical Negation
A new classical paraconsistent logic (CP), which is a variant of Nelson's paraconsistent four-valued logic, is introduced as a Gentzen-type sequent calculus. The logic CP can simulate the classical negation in classical logic by paraconsistent double negation in CP. Some theorems for syntactically and semantically embedding CP into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for CP are also shown using these embedding theorems.