{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:29Z","timestamp":1759637789010,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005076","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["G\u00f6del logic: From natural deduction to parallel computation"],"prefix":"10.1109","author":[{"given":"Federico","family":"Aschieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agata","family":"Ciabattoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco A.","family":"Genco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"The Pi-calculus A Theory of Mobile Processes","year":"2003","author":"sangiorgi","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)70849-8"},{"journal-title":"Higher-Order Concurrency Expressiveness and Decidability Results","year":"2010","author":"p\u00e9rez","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2275652"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2699407"},{"key":"ref10","first-page":"197","article-title":"Embedding formalisms: hypersequents and two-level systems of rules","author":"ciabattoni","year":"2016","journal-title":"AIML 2016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44622-2_19"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2964753"},{"journal-title":"JavaScript The Definitive Guide","year":"2011","author":"flanagan","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/32.685258"},{"journal-title":"Proofs and Types","year":"1989","author":"girard","key":"ref15"},{"key":"ref16","first-page":"65","article-title":"Zum intuitionistischen Aussagenkalkül","volume":"69","author":"g\u00f6del","year":"1932","journal-title":"Anzeiger der Kaiserlichen Akademie der Wissenschaften Mathematisch-Naturwissenschaftliche Classe"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014054"},{"key":"ref19","first-page":"151","article-title":"A lambda calculus for Gödel-Dummett logic capturing waitfreedom","author":"hirai","year":"2012","journal-title":"FLOPS 2012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2004.1319623"},{"key":"ref4","first-page":"1","article-title":"The method of hypersequents in the proof theory of propositional non-classical logic","author":"avron","year":"1996","journal-title":"Logic From Foundations to Applications"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.02.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01531058"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.57"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu037"},{"key":"ref5","first-page":"1","article-title":"A Natural Deduction System for Intuitionistic Fuzzy Logic","author":"baaz","year":"2000","journal-title":"Lectures on Soft Computing and Fuzzy logic"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15375-4_16"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50939-9_130"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.02.028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.39"},{"key":"ref1","first-page":"1","article-title":"On Natural Deduction for Herbrand Constructive Logics I: A. Correspondence for Dummett's Logic LC","volume":"12(3)","author":"aschieri","year":"2016","journal-title":"Log Meth Comput Sci"},{"key":"ref20","first-page":"479","article-title":"The formulae-as-types notion of construction","author":"howard","year":"1980","journal-title":"To H B Curry Essays on combinatory logic lambda calculus and formalism"},{"key":"ref22","first-page":"1","article-title":"Lambda-calcul types et modèles","author":"krivine","year":"1990","journal-title":"Studies in Logic and the Foundations of Math"},{"key":"ref21","first-page":"197","article-title":"Classical Realizability","author":"krivine","year":"2009","journal-title":"Interactive models of computation and program behavior Panoramas et synthèses"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2273391"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001407"},{"key":"ref25","article-title":"Proof Theory for Fuzzy Logics","volume":"36","author":"metcalfe","year":"2008","journal-title":"Springer Series in Applied Logic"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2017,6,20]]},"location":"Reykjavik, Iceland","end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005076.pdf?arnumber=8005076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T23:16:09Z","timestamp":1506986169000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005076\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005076","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}