Polynomially and superexponentially shorter proofs in fragments of arithmetic
From MaRDI portal
Publication:4032866
DOI10.2307/2275435zbMath0765.03029OpenAlexW2039356064MaRDI QIDQ4032866
Publication date: 1 April 1993
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275435
Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Complexity of proofs (03F20) Gödel numberings and issues of incompleteness (03F40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The modal logic of provability. The sequential approach
- On the scheme of induction for bounded arithmetic formulas
- On the number of steps in proofs
- Provability interpretations of modal logic
- Preface for Studia Logica special issue (2)
- Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel
- Provable Fixed Points
- Rosser sentences
- Much Shorter Proofs