{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:01Z","timestamp":1753889881045,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Automated deduction","license":[{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a goal.   Based on this model, we then analyze the following aspects: the choice of a proof shape, the choice of an induction rule and the language of the induction formula. In particular, using model-theoretic techniques, we clarify the relationship between notions of inductiveness that have been considered in the literature on automated inductive theorem proving. This is a corrected version of the paper arXiv:1704.01930v5 published originally on Nov.~16, 2017.<\/jats:p>","DOI":"10.23638\/lmcs-13(4:10)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:32:35Z","timestamp":1743701555000},"source":"Crossref","is-referenced-by-count":0,"title":["Some observations on the logical foundations of inductive theorem proving"],"prefix":"10.23638","volume":"Volume 13, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6461-5982","authenticated-orcid":false,"given":"Stefan","family":"Hetzl","sequence":"first","affiliation":[]},{"given":"Tin Lok","family":"Wong","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2018,4,13]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1704.01930v6","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1704.01930v6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:32:36Z","timestamp":1743701556000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,13]]},"references-count":0,"journal-issue":{"issue":"Automated deduction","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(4:10)2017","relation":{"has-preprint":[{"id-type":"arxiv","id":"1704.01930v4","asserted-by":"subject"},{"id-type":"arxiv","id":"1704.01930v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1704.01930v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1704.01930v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1704.01930","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1704.01930","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2018,4,13]]},"article-number":"3256"}}