{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:31Z","timestamp":1753889971710,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose a new bi-intuitionistic type theory called Dualized Type Theory\n(DTT). It is a simple type theory with perfect intuitionistic duality, and\ncorresponds to a single-sided polarized sequent calculus. We prove DTT strongly\nnormalizing, and prove type preservation. DTT is based on a new propositional\nbi-intuitionistic logic called Dualized Intuitionistic Logic (DIL) that builds\non Pinto and Uustalu's logic L. DIL is a simplification of L by removing\nseveral admissible inference rules while maintaining consistency and\ncompleteness. Furthermore, DIL is defined using a dualized syntax by labeling\nformulas and logical connectives with polarities thus reducing the number of\ninference rules needed to define the logic. We give a direct proof of\nconsistency, but prove completeness by reduction to L.<\/jats:p>","DOI":"10.2168\/lmcs-12(3:2)2016","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T10:03:42Z","timestamp":1502359422000},"source":"Crossref","is-referenced-by-count":0,"title":["Dualized Simple Type Theory"],"prefix":"10.46298","volume":"Volume 12, Issue 3","author":[{"given":"Harley","family":"Eades III","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Stump","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"McCleeary","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"1098:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2005\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2005\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:08:53Z","timestamp":1681243733000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(3:2)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1605.01083","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1605.01083","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,4,27]]},"article-number":"2005"}}