VARIANTS of KREISEL'S CONJECTURE on A NEW NOTION of PROVABILITY
Kreisel's conjecture is the statement: if, for all n ∈ ℕ, PA ⊢ksteps φ(n), then PA ⊢ ∀x.φ(x). For a theory of arithmetic T, given a recursive function h, T ⊢≤h φ holds if there is a proof of φ in T whose code is at most h(#φ). This notion depends on the underlying coding. PhT(x) is a provabilit...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2022
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/131978 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/131978 |