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...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2021
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/124149 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/124149 |