Stefan Hetzl ; Tin Lok Wong - Some observations on the logical foundations of inductive theorem proving

lmcs:3256 - Logical Methods in Computer Science, April 13, 2018, Volume 13, Issue 4 - https://doi.org/10.23638/LMCS-13(4:10)2017
Some observations on the logical foundations of inductive theorem proving

Authors: Stefan Hetzl ; Tin Lok Wong

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.


Volume: Volume 13, Issue 4
Section: Automated deduction
Published on: April 13, 2018
Accepted on: November 16, 2017
Submitted on: September 5, 2017
Keywords: Computer Science - Logic in Computer Science,Mathematics - Logic


Share

Consultation statistics

This page has been seen 836 times.
This article's PDF has been downloaded 646 times.