Complexity of proofs

[Andrew Winkler]

I recall hearing of a theorem that said something along the lines of generic axioms give rise to theorems whose proofs are exponential in the lengths of their statements. It’s not clear to me how to make that precise. Has anyone heard this? Any pointers you could give me for tracking it down? Thanks!


Sent from Yahoo Mail for iPhone
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20200724/492906c4/attachment.html>