Gilda Ferreira, Paulo Oliva, Clarence Lewis Protin
{"title":"论古典逻辑、直觉逻辑和线性逻辑之间的各种转换","authors":"Gilda Ferreira, Paulo Oliva, Clarence Lewis Protin","doi":"arxiv-2409.02249","DOIUrl":null,"url":null,"abstract":"Several different proof translations exist between classical and\nintuitionistic logic (negative translations), and intuitionistic and linear\nlogic (Girard translations). Our aims in this paper are (1) to show that all\nthese systems can be expressed as extensions of a basic logical system\n(essentially intuitionistic linear logic), and that (2) with this common\nlogical basis, a common approach to devising and simplifying such proof\ntranslations can be formalised. Via this process of ``simplification'' we get\nthe most well-known translations in the literature.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Various Translations between Classical, Intuitionistic and Linear Logic\",\"authors\":\"Gilda Ferreira, Paulo Oliva, Clarence Lewis Protin\",\"doi\":\"arxiv-2409.02249\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several different proof translations exist between classical and\\nintuitionistic logic (negative translations), and intuitionistic and linear\\nlogic (Girard translations). Our aims in this paper are (1) to show that all\\nthese systems can be expressed as extensions of a basic logical system\\n(essentially intuitionistic linear logic), and that (2) with this common\\nlogical basis, a common approach to devising and simplifying such proof\\ntranslations can be formalised. Via this process of ``simplification'' we get\\nthe most well-known translations in the literature.\",\"PeriodicalId\":501306,\"journal\":{\"name\":\"arXiv - MATH - Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.02249\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.02249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Various Translations between Classical, Intuitionistic and Linear Logic
Several different proof translations exist between classical and
intuitionistic logic (negative translations), and intuitionistic and linear
logic (Girard translations). Our aims in this paper are (1) to show that all
these systems can be expressed as extensions of a basic logical system
(essentially intuitionistic linear logic), and that (2) with this common
logical basis, a common approach to devising and simplifying such proof
translations can be formalised. Via this process of ``simplification'' we get
the most well-known translations in the literature.