Subsystems of Open Induction
Stefan Hetzl, Johannes Weiser
公開日: 2025/9/6
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.