Kreisel's Conjecture with minimality principle

DOI10.2178/JSL/1245158094zbMATH Open1180.03054OpenAlexW2079990130WikidataQ122977880 ScholiaQ122977880MaRDI QIDQ3399187FDOQ3399187

Pavel Hrubeš

Publication date: 29 September 2009

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

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

zbMATH Keywords

Peano arithmeticminimality principleKreisel's conjecture

Mathematics Subject Classification ID

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

Cites Work

• The number of proof lines and the size of proofs in first order logic
• Some results on speed-up
• Theories very close to PA where Kreisel's Conjecture is false

Cited In (1)

• Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Proof of Moll's minimum conjecture 👍 👎
• The minimal resolution conjecture 👍 👎
• On a conjecture of Kemnitz 👍 👎
• A variant of Kemnitz conjecture 👍 👎
• On a conjecture of Kemnitz 👍 👎
• Kemnitz' conjecture revisited 👍 👎
• On Kierstead’s conjecture 👍 👎

This page was built for publication: Kreisel's Conjecture with minimality principle

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