Sound generalizations in mathematical induction

Abstract : Many proofs by induction diverge without a suitable generalization of the goal to be proved. The aim of the present paper is to propose a method that automatically finds a generalized form of the goal before the induction sub-goals are generated and failure begins. The method works in the case of monomorphic theories (see Section 1). However, in contrast to all heuristic-based methods, our generalization method is sound: A goal is an inductive theorem if and only if its generalization is an inductive theorem. As far as we know this is the first approach that proposes sound generalizations for mathematical induction.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2004, 323 (1-3), pp.443-471. 〈10.1016/j.tcs.2004.05.022〉
Liste complète des métadonnées
Contributeur : Pascal Urso <>
Soumis le : mardi 17 novembre 2009 - 14:45:04
Dernière modification le : mardi 17 avril 2018 - 11:48:04

Lien texte intégral




Pascal Urso, Emmanuel Kounalis. Sound generalizations in mathematical induction. Theoretical Computer Science, Elsevier, 2004, 323 (1-3), pp.443-471. 〈10.1016/j.tcs.2004.05.022〉. 〈hal-00432860〉



Consultations de la notice