{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:24Z","timestamp":1761610524609,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6419,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1016\/s1571-0661(05)80417-7","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"183-195","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Computational isomorphisms in classical logic"],"prefix":"10.1016","volume":"3","author":[{"given":"Vincent","family":"Danos","sequence":"first","affiliation":[]},{"given":"Jean-Baptiste","family":"Joinet","sequence":"additional","affiliation":[]},{"given":"Harold","family":"Schellinx","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80417-7_BIB1","unstructured":"Danos, V., Joinet, J.-B., and Schellinx, H. (1995). DJS papers are available at http:\/\/www.logique.jussieu.fr\/www.hars.djs.html A new deconstructive logic: linear logic. Preprint nr. 936, Department of Mathematics, Utrecht University. To appear in the Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(05)80417-7_BIB2","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y. (1991) A new constructive logic: classical logic. Mathematical Structures in Computer Science, l(3):255-296.","DOI":"10.1017\/S0960129500001328"},{"key":"10.1016\/S1571-0661(05)80417-7_BIB3","unstructured":"Herbelin, H. (1995) S\u00e9quents qu'on calcule. De l'interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes. Th\u00e8se de Doctorat, Universit\u00e9 de Paris 7. Pr\u00e9publications du LITP."},{"key":"10.1016\/S1571-0661(05)80417-7_BIB4","unstructured":"Herbelin, H. (1996) B\u00f6hm trees and games, weak-head reduction and interaction between strategies. Manuscript."},{"key":"10.1016\/S1571-0661(05)80417-7_BIB5","unstructured":"Krivine, J.L. (1993) Lambda-calculus, Types and Models. Ellis Horwood, London."},{"key":"10.1016\/S1571-0661(05)80417-7_BIB6","series-title":"Theorem Proving with Analytic Tableaux and Related Methods","first-page":"226","article-title":"Strong Normalization for all-style LKtq","author":"Joinet","year":"1996"},{"key":"10.1016\/S1571-0661(05)80417-7_BIB7","unstructured":"Ong, C.-H. L. (1996) A semantic view of classical proofs: type-theoretical, categorical and denotational characterizations. Manuscript."},{"key":"10.1016\/S1571-0661(05)80417-7_BIB8","series-title":"Logic Programming and Automated Reasoning","first-page":"190","article-title":"\u03bb\u03bc-Calculus: an algorithmic interpretation of classical natural deduction","author":"Parigot","year":"1992"},{"key":"10.1016\/S1571-0661(05)80417-7_BIB9","series-title":"Logic in Computer Science","first-page":"39","article-title":"Strong normalization for second order classical natural deduction","author":"Parigot","year":"1993"},{"key":"10.1016\/S1571-0661(05)80417-7_BIB10","unstructured":"Parigot, M. (1995) Proofs of strong normalization for second order classical natural deduction. Manuscript. To appear in the Journal of Symbolic Logic."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804177?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804177?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:53Z","timestamp":1761610133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":10,"alternative-id":["S1571066105804177"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80417-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computational isomorphisms in classical logic","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80417-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}