Subsystems of Open Induction
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911141199872000 |
|---|---|
| author | Hetzl, Stefan Weiser, Johannes |
| author_facet | Hetzl, Stefan Weiser, Johannes |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_05653 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Subsystems of Open Induction Hetzl, Stefan Weiser, Johannes Logic 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. |
| title | Subsystems of Open Induction |
| topic | Logic |
| url | https://arxiv.org/abs/2509.05653 |