Subsystems of Open Induction
Logic
2025-09-09 v1
Abstract
We study subsystems of open induction which are strongly connected to methods of automated inductive theorem proving. Specifically, we consider systems obtained from restricting induction to atoms, literals, clauses, and dual clauses. We obtain a complete picture of the relationships between these systems in the language of arithmetic and its sublanguages in terms of inclusion and strict inclusion.
Cite
@article{arxiv.2509.05653,
title = {Subsystems of Open Induction},
author = {Stefan Hetzl and Johannes Weiser},
journal= {arXiv preprint arXiv:2509.05653},
year = {2025}
}