k-Provability in PA
We study the decidability of k-provability in PA —the relation ‘being provable in PA with at most k steps’—and the decidability of the proof-skeleton problem—the problem of deciding if a given formula has a proof that has a given skeleton (the list of axioms and rules that were used). The decidabili...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2021
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10362/124149 |
| Country: | Portugal |
| Oai: | oai:run.unl.pt:10362/124149 |