A logically omniscient machine is one which keeps on producing proofs of several propositions, such that
Consider the following statements.
Statement I: If the machine is known to have either proven or , then it will eventually prove .
Statement II: If the machine is known to have proven , then it will either eventually prove (or have proven) or prove (or have proven) .
Which of them is true?
This problem is a part of Tessellate S.T.E.M.S.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!