\(k\)-provability in \(\mathrm{PA}\)
From MaRDI portal
Publication:2070428
DOI10.1007/S11787-021-00278-1OpenAlexW3166534815MaRDI QIDQ2070428
Paulo Guilherme Santos, Reinhard Kahle
Publication date: 24 January 2022
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-021-00278-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
- The number of proof lines and the size of proofs in first order logic
- On the length of proofs in formal systems
- The undecidability of \(k\)-provability
- The Kreisel length-of-proof problem
- A unification-theoretic method for investigating the \(k\)-provability problem
- Theories very close to PA where Kreisel's Conjecture is false
- Some Results on the Length of Proofs
This page was built for publication: \(k\)-provability in \(\mathrm{PA}\)