{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:59:23Z","timestamp":1743134363777,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142024"},{"type":"electronic","value":"9783642142031"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14203-1_25","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T13:10:58Z","timestamp":1278940258000},"page":"293-308","source":"Crossref","is-referenced-by-count":6,"title":["A Decidable Class of Nested Iterated Schemata"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Aravantinos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Caferra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Peltier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-02716-1_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"V. Aravantinos","year":"2009","unstructured":"Aravantinos, V., Caferra, R., Peltier, N.: A Schemata Calculus For Propositional Logic. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 32\u201346. Springer, Heidelberg (2009)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Aravantinos, V., Caferra, R., Peltier, N.: A Decidable Class of Nested Iterated Schemata (extended version). Technical report, Laboratory of Informatics of Grenoble (2010), http:\/\/arxiv.org\/abs\/1001.4251","DOI":"10.1007\/978-3-642-14203-1_25"},{"key":"25_CR3","volume-title":"A Computational Logic","author":"R.S. Boyer","year":"1979","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, New York (1979)"},{"key":"25_CR4","series-title":"Studies in Logic and Practical Reasoning","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-2464(07)80015-2","volume-title":"Handbook of Modal Logic","author":"J. Bradfield","year":"2007","unstructured":"Bradfield, J., Stirling, C.: Modal Mu-Calculi. In: Blackburn, P., van Benthem, J.F.A.K., Wolter, F. (eds.) Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol.\u00a03. Elsevier Science Inc., New York (2007)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The Automation of Proof by Mathematical Induction. In: [13], pp. 845\u2013911","DOI":"10.1016\/B978-044450813-3\/50015-1"},{"key":"25_CR6","unstructured":"Comon, H.: Inductionless induction. In: [13], ch. 14"},{"key":"25_CR7","unstructured":"Cooper, D.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a07. Edinburgh University Press (1972)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.2178\/bsl\/1146620060","volume":"12","author":"J. Corcoran","year":"2006","unstructured":"Corcoran, J.: Schemata: the concept of schema in the history of logic. The Bulletin of Symbolic Logic\u00a012(2), 219\u2013240 (2006)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communication of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communication of the ACM"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90218-I","volume":"116","author":"R. Fagin","year":"1993","unstructured":"Fagin, R.: Finite-Model Theory - A Personal Perspective. Theoretical Computer Science\u00a0116, 3\u201331 (1993)","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/10721959_26","volume-title":"Automated Deduction - CADE-17","author":"D. Kapur","year":"2000","unstructured":"Kapur, D., Subramaniam, M.: Extending Decision Procedures with Induction Schemes. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 324\u2013345. Springer, Heidelberg (2000)"},{"issue":"2","key":"25_CR12","doi-asserted-by":"crossref","first-page":"1610","DOI":"10.1007\/BF01098278","volume":"55","author":"V.P. Orevkov","year":"1991","unstructured":"Orevkov, V.P.: Proof schemata in Hilbert-type axiomatic theories. Journal of Mathematical Sciences\u00a055(2), 1610\u20131620 (1991)","journal-title":"Journal of Mathematical Sciences"},{"volume-title":"Handbook of Automated Reasoning (in 2 volumes)","year":"2001","key":"25_CR13","unstructured":"Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier, Amsterdam (2001)"}],"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-642-14203-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T07:26:08Z","timestamp":1711610768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14203-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142024","9783642142031"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14203-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}