{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T06:57:41Z","timestamp":1776409061045,"version":"3.51.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We present $\\cal L$, an extension of Parigot's $\\lambda\\mu$-calculus by\nadding negation as a type constructor, together with syntactic constructs that\nrepresent negation introduction and elimination. We will define a notion of\nreduction that extends $\\lambda\\mu$'s reduction system with two new reduction\nrules, and show that the system satisfies subject reduction. Using Aczel's\ngeneralisation of Tait and Martin-L\\\"of's notion of parallel reduction, we show\nthat this extended reduction is confluent. Although the notion of type\nassignment has its limitations with respect to representation of proofs in\nnatural deduction with implication and negation, we will show that all\npropositions that can be shown in there have a witness in $\\cal L$. Using\nGirard's approach of reducibility candidates, we show that all typeable terms\nare strongly normalisable, and conclude the paper by showing that type\nassignment for $\\cal L$ enjoys the principal typing property.<\/jats:p>","DOI":"10.46298\/lmcs-19(2:12)2023","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T08:00:21Z","timestamp":1685001621000},"source":"Crossref","is-referenced-by-count":4,"title":["Adding Negation to Lambda Mu"],"prefix":"10.46298","volume":"Volume 19, Issue 2","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2023,5,25]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/11371\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/11371\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:23Z","timestamp":1687292423000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/8520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,25]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(2:12)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2109.10447v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2109.10447v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2109.10447","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2109.10447","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,25]]},"article-number":"8520"}}