Pages that link to "Item:Q4314669"
From MaRDI portal
The following pages link to On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics (Q4314669):
Displaying 19 items.
- Naturalizing indispensability: a rejoinder to `The varieties of indispensability arguments' (Q516230) (← links)
- New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems (Q804570) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- Deflationary truth and pathologies (Q975779) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- On formalization of model-theoretic proofs of Gödel's theorems (Q1893141) (← links)
- Geometric spin Hall effect for Gaussian beam (Q2810347) (← links)
- TRUTH AND SPEED-UP (Q2940877) (← links)
- Von Neumann, Gödel and Complexity Theory (Q3067861) (← links)
- Relativized Gödel speed-up and the degree of succinctness of representations (Q3197811) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Non-elementary speed-ups in logic calculi (Q3545216) (← links)
- A Connection Between Blum Speedable Sets and Gödel's Speed-Up Theorem (Q3751574) (← links)
- Much Shorter Proofs (Q4206724) (← links)
- A Note on the Length of Proofs (Q4306545) (← links)
- On the Difficulty of Writing Out formal Proofs in Arithmetic (Q4351922) (← links)
- On sets, types, fixed points, and checkerboards (Q4645222) (← links)
- On the complexity of Gödel's proof predicate (Q5190198) (← links)
