TR-2014002: Proof Complexity and Quantitative Epistemology
Natalia Novak · CUNY Academic Works (City University of New York) · 2014
There is a famous epistemic Surprise Examination Paradox (SEP) which was studied for at least half a century.We look at its formalization in MetaPRL logical framework in order to see how the change in its dimensions affects the automatic proof search.