In first-order logic, the formula-based instances of the Noetherian induction principle allow to
perform effectively simultaneous, mutual and lazy induction reasoning. Compared to the …

SPIKE, an induction-based theorem prover built to reason on conditional theories with
equality, is one of the few formal tools able to perform automatically mutual and lazy …

Structural and (Noetherian) cyclic induction are two instances of the Noetherian induction
principle adapted to reason on first-order logic. From a theoretical point of view, every …

Cyclic induction is a powerful reasoning technique that consists in blocking the proof
development of certain subgoals already encountered during the proof process. In the …

Noetherian induction is one of the most general induction principles used in formal
reasoning. In the frame of the first-order reasoning, we propose a classification of its …

Résumé Les preuves par récurrence sont parfaitement adaptées au raisonnement sur des
structures de données non-bornées, comme par exemple les entiers et les listes, ou, de …