{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:05:47Z","timestamp":1769915147056,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_17","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"297-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory"],"prefix":"10.1007","author":[{"given":"Abhishek","family":"De","sequence":"first","affiliation":[]},{"given":"Alexis","family":"Saurin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-02716-1_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D Baelde","year":"2009","unstructured":"Baelde, D.: On the proof theory of regular fixed points. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 93\u2013107. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02716-1_8"},{"issue":"1","key":"17_CR2","first-page":"2","volume":"13","author":"D Baelde","year":"2012","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Computat. Logic (TOCL) 13(1), 2 (2012)","journal-title":"ACM Trans. Computat. Logic (TOCL)"},{"key":"17_CR3","unstructured":"Baelde, D., Doumane, A., Kuperberg, D., Saurin, A.: Bouncing threads for infinitary and circular proofs. Manuscript, June 2019"},{"key":"17_CR4","unstructured":"Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, Marseille, France, 29 August\u20131 September 2016. LIPIcs, vol. 62, pp. 42:1\u201342:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75560-9_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Baelde","year":"2007","unstructured":"Baelde, D., Miller, D.: Least and greatest fixed points in linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 92\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_9"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-662-46678-0_28","volume-title":"Foundations of Software Science and Computation Structures","author":"M Bagnol","year":"2015","unstructured":"Bagnol, M., Doumane, A., Saurin, A.: On the dependencies of logical rules. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 436\u2013450. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_28"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0022-4049(95)00159-X","volume":"113","author":"RF Blute","year":"1996","unstructured":"Blute, R.F., Cockett, J.R.B., Seely, R.A.G., Trimble, T.H.: Natural deduction and coherence for weakly distributive categories. J. Pure Appl. Algebr. 113(3), 229\u2013296 (1996)","journal-title":"J. Pure Appl. Algebr."},{"key":"17_CR8","unstructured":"Brotherston, J.: Sequent calculus proof systems for inductive definitions. Ph.D. thesis, University of Edinburgh, November 2006"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Simpson, A.: Complete sequent calculi for induction and infinite descent. In: Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), Wroclaw, Poland, 10\u201312 July 2007, pp. 51\u201362. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.16"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1093\/logcom\/exq052","volume":"21","author":"J Brotherston","year":"2011","unstructured":"Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6), 1177\u20131216 (2011)","journal-title":"J. Log. Comput."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-00596-1_3","volume-title":"Foundations of Software Science and Computational Structures","author":"P Clairambault","year":"2009","unstructured":"Clairambault, P.: Least and greatest fixpoints in game semantics. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 16\u201331. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_3"},{"key":"17_CR12","unstructured":"Curien, P.-L.: Introduction to linear logic and ludics, Part II (2006)"},{"key":"17_CR13","unstructured":"Danos, V.: Une application de la logique lin\u00e9aire \u00e1 l\u2019\u00e9tude des processus de normalisation (principalement du $$\\lambda $$ \u03bb -calcul). Th\u00e8se de doctorat, Universit\u00e9 Denis Diderot, Paris 7 (1990)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Arch. Math. Log. 28, 181\u2013203 (1989)","journal-title":"Arch. Math. Log."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11944836_26","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"C Dax","year":"2006","unstructured":"Dax, C., Hofmann, M., Lange, M.: A proof system for the linear time $$\\mu $$ \u03bc -calculus. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 273\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_26"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"De, A., Saurin, A.: Infinets: the parallel syntax for non-wellfounded proof-theory. Long version, June 2019","DOI":"10.1007\/978-3-030-29026-9_17"},{"key":"17_CR17","unstructured":"Doumane, A.: On the infinitary proof theory of logics with fixed points. (Th\u00e9orie de la d\u00e9monstration infinitaire pour les logiques \u00e0 points fixes). Ph.D. thesis, Paris Diderot University, France (2017)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Doumane, A., Baelde, D., Hirschi, L., Saurin, A.: Towards completeness via proof search in the linear time $$\\mu $$ \u03bc -calculus, January 2016. Accepted for publication at LICS","DOI":"10.1145\/2933575.2933598"},{"key":"17_CR19","unstructured":"Fortier, J., Santocanale, L.: Cuts for circular proofs: semantics and cut-elimination. In: Della Rocca, S.R., (ed.) Computer Science Logic 2013 (CSL 2013), CSL, Torino, Italy, 2\u20135 September 2013. LIPIcs, vol. 23, pp. 248\u2013262. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR21","unstructured":"Girard, J.-Y.: Proof-nets: the parallel syntax for proof theory (1996)"},{"issue":"20","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.tcs.2010.12.021","volume":"412","author":"S Guerrini","year":"2011","unstructured":"Guerrini, S.: A linear algorithm for mll proof net correctness and sequentialization. Theor. Comput. Sci. 412(20), 1958\u20131978 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR23","series-title":"Workshops in Computing","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-1-4471-3078-9_13","volume-title":"Structures in Concurrency Theory","author":"R Kaivola","year":"1995","unstructured":"Kaivola, R.: A simple decision method for the linear time mu-calculus. In: Desel, J. (ed.) Structures in Concurrency Theory. Workshops in Computing, pp. 190\u2013204. Springer, London (1995). https:\/\/doi.org\/10.1007\/978-1-4471-3078-9_13"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theor. Comput. Sci. 27, 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Higher-order parity automata. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, 20\u201323 June 2017, pp. 1\u201312. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005077"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-44904-3_18","volume-title":"Typed Lambda Calculi and Applications","author":"R Montelatici","year":"2003","unstructured":"Montelatici, R.: Polarized proof nets with cycles and fixpoints semantics. In: Hofmann, M. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 256\u2013270. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44904-3_18"},{"key":"17_CR27","first-page":"59","volume":"5","author":"D Park","year":"1969","unstructured":"Park, D.: Fixpoint induction and proofs of program properties. Mach. Intell. 5, 59\u201378 (1969)","journal-title":"Mach. Intell."},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45931-6_25","volume-title":"Foundations of Software Science and Computation Structures","author":"L Santocanale","year":"2002","unstructured":"Santocanale, L.: A calculus of circular proofs and its categorical semantics. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 357\u2013371. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_25"},{"key":"17_CR29","unstructured":"Walukiewicz, I.: On completeness of the mu-calculus. In: Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS 1993), Montreal, Canada, 19\u201323 June 1993, pp. 136\u2013146. IEEE Computer Society (1993)"},{"key":"17_CR30","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional mu-calculus. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, USA, 26\u201329 June 1995, pp. 14\u201324. IEEE Computer Society (1995)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T17:42:13Z","timestamp":1575567733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}