{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:45:36Z","timestamp":1774046736211,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031742088","type":"print"},{"value":"9783031742095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74209-5_3","type":"book-chapter","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T06:01:44Z","timestamp":1728626504000},"page":"30-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Sequent Calculus for\u00a0Generalized Inductive Definitions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2579-9053","authenticated-orcid":false,"given":"Robbe","family":"Van den Eede","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6605-8983","authenticated-orcid":false,"given":"Robbe","family":"Van Biervliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0422-7339","authenticated-orcid":false,"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"issue":"6","key":"3_CR1","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":"3_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/3-540-44957-4_47","volume-title":"Computational Logic \u2014 CL 2000","author":"M Denecker","year":"2000","unstructured":"Denecker, M.: Extending classical logic with inductive definitions. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 703\u2013717. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_47"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1342991.1342998","volume":"9","author":"M Denecker","year":"2008","unstructured":"Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. ACM Trans. Comput. Log. (TOCL) 9(2), 1\u201352 (2008)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-72200-7_9","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Denecker","year":"2007","unstructured":"Denecker, M., Vennekens, J.: Well-founded semantics and the algebraic theory of non-monotone inductive definitions. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 84\u201396. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72200-7_9"},{"key":"3_CR5","unstructured":"Denecker, M., Vennekens, J.: The well-founded semantics is the principle of inductive definition, revisited. In: Chitta, B., De\u00a0Giacomo, G. (eds.) Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press (2014)"},{"issue":"176\u2013210","key":"3_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01201363","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schliessen. I. Math. Zeitschrift 39(176\u2013210), 405\u2013431 (1935)","journal-title":"I. Math. Zeitschrift"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-04238-6_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P Hou","year":"2009","unstructured":"Hou, P., Denecker, M.: A deductive system for FO(ID) based on least fixpoint logic. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 129\u2013141. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04238-6_13"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-72200-7_15","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P Hou","year":"2007","unstructured":"Hou, P., Wittocx, J., Denecker, M.: A deductive system for PC(ID). In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 162\u2013174. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72200-7_15"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a063, pp. 179\u2013216. Elsevier (1971)","DOI":"10.1016\/S0049-237X(08)70847-4"},{"issue":"1","key":"3_CR10","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. Theoret. Comput. Sci. 232(1), 91\u2013119 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-24849-1_19","volume-title":"Types for Proofs and Programs","author":"A Momigliano","year":"2004","unstructured":"Momigliano, A., Tiu, A.: Induction and co-induction in sequent calculus. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 293\u2013308. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24849-1_19"},{"key":"3_CR12","unstructured":"Van\u00a0Biervliet, R.: Inductive definitions in proof systems. Master\u2019s thesis, KU Leuven (2023)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 619\u2013649 (1991)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74209-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:02:38Z","timestamp":1736614958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74209-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031742088","9783031742095"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74209-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2024.demacs.unical.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}