Analysis of open induction subsystems shows strong links to automated inductive theorem proving methods.
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.
No takes yet. Share an insight, caveat, or question.
Hetzl et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: