{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:52:32Z","timestamp":1743094352310,"version":"3.40.3"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030510732"},{"type":"electronic","value":"9783030510749"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51074-9_21","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T22:02:47Z","timestamp":1593468167000},"page":"375-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Integrating Induction and Coinduction via Closure Operators and Proof Cycles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6608-3000","authenticated-orcid":false,"given":"Liron","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4271-9078","authenticated-orcid":false,"given":"Reuben N. S.","family":"Rowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"e2","DOI":"10.1017\/S0956796816000022","volume":"26","author":"A Abel","year":"2016","unstructured":"Abel, A., Pientka, B.: Well-founded recursion with copatterns and sized types. J. Funct. Program. 26, e2 (2016). https:\/\/doi.org\/10.1017\/S0956796816000022","journal-title":"J. Funct. Program."},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Afshari, B., Leigh, G.E.: Cut-free completeness for modal mu-calculus. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2017), Reykjavik, Iceland, 20\u201323 June 2017, pp. 1\u201312 (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005088","DOI":"10.1109\/LICS.2017.8005088"},{"key":"21_CR3","series-title":"Applied Logic Series","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-94-017-0253-9_7","volume-title":"Thirty Five Years of Automating Mathematics, Applied Logic Series","author":"A Avron","year":"2003","unstructured":"Avron, A.: Transitive closure and the mechanization of mathematics. In: Kamareddine, F.D. (ed.) Thirty Five Years of Automating Mathematics, Applied Logic Series. APLS 2013, vol. 28, pp. 149\u2013171. Springer, Netherlands (2003). https:\/\/doi.org\/10.1007\/978-94-017-0253-9_7"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/2071368.2071370","volume":"13","author":"D Baelde","year":"2012","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Log. 13(1), 2:1\u20132:44 (2012). https:\/\/doi.org\/10.1145\/2071368.2071370","journal-title":"ACM Trans. Comput. Log."},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: Proceedings of the 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), 29 August\u20131 September 2016, Marseille, France, pp. 42:1\u201342:17 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2016.42","DOI":"10.4230\/LIPIcs.CSL.2016.42"},{"key":"21_CR6","unstructured":"Basold, H.: Mixed Inductive-Coinductive Reasoning Types, Programs and Logic. Ph.D. thesis, Radboud University (2018). https:\/\/hdl.handle.net\/2066\/190323"},{"key":"21_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-03359-9_6","volume-title":"Theorem Proving in Higher Order Logics","author":"A Bove","year":"2009","unstructured":"Bove, A., Dybjer, P., Norell, U.: A brief overview of Agda \u2013 a functional language with dependent types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 73\u201378. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_6"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1017\/S095679681300018X","volume":"23","author":"E Brady","year":"2013","unstructured":"Brady, E.: Idris, a general-purpose dependently typed programming language: design and implementation. J. Funct. Program. 23, 552\u2013593 (2013). https:\/\/doi.org\/10.1017\/S095679681300018X","journal-title":"J. Funct. Program."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-74061-2_6","volume-title":"Static Analysis","author":"J Brotherston","year":"2007","unstructured":"Brotherston, J.: Formalised inductive reasoning in the logic of bunched implications. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 87\u2013103. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_6"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Brotherston, J., Bornat, R., Calcagno, C.: Cyclic proofs of program termination in separation logic. In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2008), pp. 101\u2013112 (2008). https:\/\/doi.org\/10.1145\/1328438.1328453","DOI":"10.1145\/1328438.1328453"},{"issue":"6","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1093\/logcom\/exq052","volume":"21","author":"J Brotherston","year":"2010","unstructured":"Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6), 1177\u20131216 (2010). https:\/\/doi.org\/10.1093\/logcom\/exq052","journal-title":"J. Log. Comput."},{"key":"21_CR13","unstructured":"Buss, S.R.: Handbook of proof theory. In: Studies in Logic and the Foundations of Mathematics. Elsevier Science (1998)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-66902-1_15","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"L Cohen","year":"2017","unstructured":"Cohen, L.: Completeness for ancestral logic via a computationally-meaningful semantics. In: Schmidt, R.A., Nalon, C. (eds.) TABLEAUX 2017. LNCS (LNAI), vol. 10501, pp. 247\u2013260. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66902-1_15"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-662-44145-9_10","volume-title":"Logic, Language, Information, and Computation","author":"L Cohen","year":"2014","unstructured":"Cohen, L., Avron, A.: Ancestral logic: a proof theoretical study. In: Kohlenbach, U., Barcel\u00f3, P., de Queiroz, R. (eds.) WoLLIC 2014. LNCS, vol. 8652, pp. 137\u2013151. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44145-9_10"},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Cohen, L., Avron, A.: The middle ground-ancestral logic. Synthese, 1\u201323 (2015). https:\/\/doi.org\/10.1007\/s11229-015-0784-3","DOI":"10.1007\/s11229-015-0784-3"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Cohen, L., Rowe, R.N.S.: Uniform inductive reasoning in transitive closure logic via infinite descent. In: Proceedings of the 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 4\u20137 September 2018, Birmingham, UK, pp. 16:1\u201316:17 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2018.16","DOI":"10.4230\/LIPIcs.CSL.2018.16"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Cohen, L., Rowe, R.N.S.: Non-well-founded proof theory of transitive closure logic. Trans. Comput. Logic (2020, to appear). https:\/\/arxiv.org\/pdf\/1802.00756.pdf","DOI":"10.1145\/3404889"},{"issue":"5","key":"21_CR19","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1093\/logcom\/exz011","volume":"29","author":"L Cohen","year":"2019","unstructured":"Cohen, L., Rowe, R.N.S., Zohar, Y.: Towards automated reasoning in Herbrand structures. J. Log. Comput. 29(5), 693\u2013721 (2019). https:\/\/doi.org\/10.1093\/logcom\/exz011","journal-title":"J. Log. Comput."},{"key":"21_CR20","volume-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"RL Constable","year":"1986","unstructured":"Constable, R.L., et al.: Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall Inc, Upper Saddle River (1986)"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"SA Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symbolic Log. 44(1), 36\u201350 (1979). https:\/\/doi.org\/10.2307\/2273702","journal-title":"J. Symbolic Log."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theor. Comput. Sci. 25, 95\u2013169 (1983). https:\/\/doi.org\/10.1016\/0304-3975(83)90059-2","journal-title":"Theor. Comput. Sci."},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Das, A., Pous, D.: Non-Wellfounded Proof Theory for (Kleene+Action)(Algebras+Lattices). In: Proceedings of the 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), pp. 19:1\u201319:18 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2018.19","DOI":"10.4230\/LIPIcs.CSL.2018.19"},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Doumane, A.: Constructive completeness for the linear-time $$\\mu $$-calculus. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2017), pp. 1\u201312 (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005075","DOI":"10.1109\/LICS.2017.8005075"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Endrullis, J., Hansen, H., Hendriks, D., Polonsky, A., Silva, A.: A coinductive framework for infinitary rewriting and equational reasoning. In: 26th International Conference on Rewriting Techniques and Applications (RTA 2015), vol. 36, pp. 143\u2013159 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2015.143","DOI":"10.4230\/LIPIcs.RTA.2015.143"},{"key":"21_CR26","doi-asserted-by":"publisher","unstructured":"Fortier, J., Santocanale, L.: Cuts for circular proofs: semantics and cut-elimination. In: Rocca, S.R.D. (ed.) Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol. 23, pp. 248\u2013262. Dagstuhl, Germany (2013). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.248","DOI":"10.4230\/LIPIcs.CSL.2013.248"},{"issue":"6","key":"21_CR27","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S0956796802004318","volume":"12","author":"V Gapeyev","year":"2002","unstructured":"Gapeyev, V., Levin, M.Y., Pierce, B.C.: Recursive subtyping revealed. J. Funct. Program. 12(6), 511\u2013548 (2002). https:\/\/doi.org\/10.1017\/S0956796802004318","journal-title":"J. Funct. Program."},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das Logische Schlie\u00dfen. I. Mathematische Zeitschrift 39(1), 176\u2013210 (1935). https:\/\/doi.org\/10.1007\/BF01201353","journal-title":"Mathematische Zeitschrift"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Hansen, H.H., Kupke, C., Rutten, J.: Stream differential equations: specification formats and solution methods. In: Logical Methods in Computer Science, vol. 13(1), February 2017. https:\/\/doi.org\/10.23638\/LMCS-13(1:3)2017","DOI":"10.23638\/LMCS-13(1:3)2017"},{"issue":"4","key":"21_CR30","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s10817-018-9475-3","volume":"63","author":"Q Heath","year":"2019","unstructured":"Heath, Q., Miller, D.: A proof theory for model checking. J. Autom. Reasoning 63(4), 857\u2013885 (2019). https:\/\/doi.org\/10.1007\/s10817-018-9475-3","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"21_CR31","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput. 16(4), 760\u2013778 (1987). https:\/\/doi.org\/10.1137\/0216051","journal-title":"SIAM J. Comput."},{"key":"21_CR32","first-page":"222","volume":"62","author":"B Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.: A tutorial on (co) algebras and (co) induction. Bull. Eur. Assoc. Theor. Comput. Sci. 62, 222\u2013259 (1997)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"347","DOI":"10.3233\/FI-2017-1473","volume":"150","author":"JB Jeannin","year":"2017","unstructured":"Jeannin, J.B., Kozen, D., Silva, A.: CoCaml: functional programming with regular coinductive types. Fundamenta Informaticae 150, 347\u2013377 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1473","journal-title":"Fundamenta Informaticae"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-22944-2_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"E Komendantskaya","year":"2011","unstructured":"Komendantskaya, E., Power, J.: Coalgebraic semantics for derivations in logic programming. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 268\u2013282. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_19"},{"issue":"7","key":"21_CR35","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1017\/S0960129515000493","volume":"27","author":"D Kozen","year":"2017","unstructured":"Kozen, D., Silva, A.: Practical coinduction. Math. Struct. Comput. Sci. 27(7), 1132\u20131152 (2017). https:\/\/doi.org\/10.1017\/S0960129515000493","journal-title":"Math. Struct. Comput. Sci."},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Leino, R., Moskal, M.: Co-induction simply: automatic co-inductive proofs in a program verifier. Technical report MSR-TR-2013-49, Microsoft Research, July 2013. https:\/\/www.microsoft.com\/en-us\/research\/publication\/co-induction-simply-automatic-co-inductive-proofs-in-a-program-verifier\/","DOI":"10.1007\/978-3-319-06410-9_27"},{"issue":"2","key":"21_CR37","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ic.2007.12.004","volume":"207","author":"X Leroy","year":"2009","unstructured":"Leroy, X., Grall, H.: Coinductive big-step operational semantics. Inf. Comput. 207(2), 284\u2013304 (2009). https:\/\/doi.org\/10.1016\/j.ic.2007.12.004","journal-title":"Inf. Comput."},{"key":"21_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-73859-6_25","volume-title":"Algebra and Coalgebra in Computer Science","author":"D Lucanu","year":"2007","unstructured":"Lucanu, D., Ro\u015fu, G.: CIRC: a circular coinductive prover. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 372\u2013378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73859-6_25"},{"issue":"1","key":"21_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267976","volume":"8","author":"RM Martin","year":"1943","unstructured":"Martin, R.M.: A homogeneous system for formal logic. J. Symbolic Log. 8(1), 1\u201323 (1943). https:\/\/doi.org\/10.2307\/2267976","journal-title":"J. Symbolic Log."},{"key":"21_CR40","doi-asserted-by":"publisher","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, Studies in Logic and the Foundations of Mathematics, vol. 63, pp. 179\u2013216. Elsevier (1971). https:\/\/doi.org\/10.1016\/S0049-237X(08)70847-4","DOI":"10.1016\/S0049-237X(08)70847-4"},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-03741-2_9","volume-title":"Algebra and Coalgebra in Computer Science","author":"C McBride","year":"2009","unstructured":"McBride, C.: Let\u2019s see how things unfold: reconciling the infinite with the intensional (extended abstract). In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 113\u2013126. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_9"},{"issue":"1\u20132","key":"21_CR42","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(99)00171-1","volume":"232","author":"R McDowell","year":"2000","unstructured":"McDowell, R., Miller, D.: Cut-elimination for a logic with definitions and induction. Theor. Comput. Sci. 232(1\u20132), 91\u2013119 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00171-1","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR43","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","volume":"3","author":"DMR Park","year":"1976","unstructured":"Park, D.M.R.: Finiteness is mu-ineffable. Theor. Comput. Sci. 3(2), 173\u2013181 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90022-0","journal-title":"Theor. Comput. Sci."},{"key":"21_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-03741-2_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Lucanu, D.: Circular coinduction: a proof theoretical foundation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 127\u2013144. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_10"},{"key":"21_CR45","doi-asserted-by":"publisher","unstructured":"Rowe, R.N.S., Brotherston, J.: Automatic cyclic termination proofs for recursive procedures in separation logic. In: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2017), Paris, France, 16\u201317 January 2017, pp. 53\u201365 (2017). https:\/\/doi.org\/10.1145\/3018610.3018623","DOI":"10.1145\/3018610.3018623"},{"issue":"1","key":"21_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR47","unstructured":"Rutten, J.: On Streams and Coinduction (2002). https:\/\/homepages.cwi.nl\/~janr\/papers\/files-of-papers\/CRM.pdf"},{"key":"21_CR48","volume-title":"The Method of Coalgebra: Exercises in Coinduction","author":"J Rutten","year":"2019","unstructured":"Rutten, J.: The Method of Coalgebra: Exercises in Coinduction. CWI, Amsterdam (2019)"},{"key":"21_CR49","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511792588","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"D Sangiorgi","year":"2011","unstructured":"Sangiorgi, D., Rutten, J.: Advanced Topics in Bisimulation and Coinduction, 1st edn. Cambridge University Press, Cambridge (2011)","edition":"1"},{"key":"21_CR50","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":"21_CR51","volume-title":"Foundations Without Foundationalism : A Case for Second-order Logic","author":"S Shapiro","year":"1991","unstructured":"Shapiro, S.: Foundations Without Foundationalism : A Case for Second-order Logic. Clarendon Press, Oxford Logic Guides (1991)"},{"key":"21_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-73420-8_42","volume-title":"Automata, Languages and Programming","author":"L Simon","year":"2007","unstructured":"Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-logic programming: extending logic programming with coinduction. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 472\u2013483. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_42"},{"key":"21_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive logic programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 330\u2013345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799573_25"},{"key":"21_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-662-54458-7_17","volume-title":"Foundations of Software Science and Computation Structures","author":"A Simpson","year":"2017","unstructured":"Simpson, A.: Cyclic arithmetic is equivalent to peano arithmetic. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 283\u2013300. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_17"},{"key":"21_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-36576-1_27","volume-title":"Foundations of Software Science and Computation Structures","author":"C Sprenger","year":"2003","unstructured":"Sprenger, C., Dam, M.: On the structure of inductive reasoning: circular and tree-shaped proofs in the $$\\mu $$calculus. In: Gordon, A.D. (ed.) FoSSaCS 2003. LNCS, vol. 2620, pp. 425\u2013440. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36576-1_27"},{"key":"21_CR56","volume-title":"Proof Theory. Dover Books on Mathematics","author":"G Takeuti","year":"2013","unstructured":"Takeuti, G.: Proof Theory. Dover Books on Mathematics. Dover Publications, Incorporated, New York (2013)"},{"key":"21_CR57","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-63046-5_30","volume-title":"Automated Deduction \u2013 CADE 26","author":"G Tellez","year":"2017","unstructured":"Tellez, G., Brotherston, J.: Automatically verifying temporal properties of pointer programs with cyclic proof. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 491\u2013508. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_30"},{"key":"21_CR58","unstructured":"Tiu, A.: A Logical Framework For Reasoning About Logical Specifications. Ph.D. thesis, Penn. State University (2004)"},{"issue":"4","key":"21_CR59","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.jal.2012.07.007","volume":"10","author":"A Tiu","year":"2012","unstructured":"Tiu, A., Momigliano, A.: Cut elimination for a logic with induction and co-induction. J. Appl. Log. 10(4), 330\u2013367 (2012). https:\/\/doi.org\/10.1016\/j.jal.2012.07.007","journal-title":"J. Appl. Log."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51074-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T21:34:30Z","timestamp":1656797670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51074-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510732","9783030510749"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51074-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcar2020.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":"150","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":"46","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":"5","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":"31% - 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.03","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":"7.38","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 system descriptions are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}