Theories very close to PA where Kreisel's Conjecture is false

DOI10.2178/JSL/1174668388MaRDI QIDQ3426567zbMATH OpenOpenAlexWikidataFDO

Authors Pavel Hrubeš

Publication date 12 March 2007

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1174668388

zbMATH Keywords

length of proofsPeano arithmeticproof complexity

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 4033741
• Kreisel's Conjecture with minimality principle
• The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
• Taking out LK parts from a proof in Peano arithmetic
• scientific article; zbMATH DE number 440474

Cited in

(8)

• \(k\)-provability in \(\mathrm{PA}\)
• Kreisel's Conjecture with minimality principle
• scientific article; zbMATH DE number 4152372 (Why is no real title available?)
• scientific article; zbMATH DE number 4033741 (Why is no real title available?)
• scientific article; zbMATH DE number 481931 (Why is no real title available?)
• VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
• The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
• Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).

This page was built for publication: Theories very close to PA where Kreisel's Conjecture is false

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426567)