Ah, this thread is revived. Rudely ignoring everyone and just talking to myself out loud (perhaps even repeating things which have been said before, perhaps even by me):
An analysis of the 2-day version (needlessly more complicated than the 1-day version, but I recall insistence that the 1-day version does not contain the crux of the matter, so I’ll play along):
Let’s formalize the teacher’s setup as “I will give you a quiz on either Monday or Tuesday (but not both). The date of the quiz will be a surprise in the sense that if you can only prove true things, all the following will hold: if the quiz is on Monday, you will not be able to prove (from this very setup) that the quiz is on Monday. If the quiz is on Tuesday, you will not be able to prove (from this very setup and the quiz not being on Monday) that the quiz is on Tuesday.” (The reason I’ve tossed in that bit about “if you can only prove true things” is because, without it, the teacher can easily be made incorrect by a student who uses a fallacious system of “proof” which just happens, by sheer lucky sophistry, to prove whatever, preventing surprise)
Some symbols (not that symbols are any intrinsically better than words, but I’m accustomed to these ones and find them convenient):
First, judgements that we may make of propositions:
A |- B will mean that B is entailed by the premises A
Now, some logical connectives that we can use to construct propositions out of other ones:
A -> B is the proposition “If A holds, then B holds” [implication]
~A is the proposition “A does not hold” [negation]
A v B is the proposition “At least one of A or B holds” [binary disjunction]
A[sub]1[/sub] & A[sub]2[/sub] & … & A[sub]n[/sub] is the proposition “A[sub]1[/sub] and A[sub]2[/sub] and … and A[sub]n[/sub] all hold” [n-ary conjunction]. I may even speak of an n-ary conjunction where n = 0; in that case, this is a trivial, tautologically true proposition, which I will denote by *.
[]A is the proposition “A is provable (in whatever particular proof system the student is using)” [a box-like modal operator]
Now some names for specific propositions. Let K denote the teacher’s setup, M denote the proposition “The quiz will be on Monday”, T denote the proposition “The quiz will be on Tuesday”, and S denote the proposition “The student can only prove true things”.
We can take S as something like “For all propositions A, it is the case that A -> A”. [I’ll call this “(student)-soundness”, even though some might want that name to refer to something stricter]
K is self-referential (as seen from the instances of “this very setup” within its phrasing). We may have qualms about the legitimacy of self-referential propositions (considering examples like “This sentence is false”, and so on). K’s self-referentiality is of a form often considered somewhat more innocuous (in that all the recursive references are “guarded” by being under the scope of an instance of our modal operator ), but we may still worry about it. However, if we do grant K legitimacy, then we have, just reading off mechanically, that K = (M v T) & ~(M & T) & (S -> ((M -> ~(K -> M)) & (T -> ~((K & ~M) -> T))))
Great. Next, let’s start formalizing as much of the student’s reasoning as we can by seeing what follows from granting the existence of such a proposition as K. I will assume all the usual laws of logic for how to validly draw judgements using the usual logical connectives; plus, for the operator , I will assume that from the judgement “A1 & … & An |- B”, we can draw the judgement “A1 & … & An |- B” (i.e., the student’s proof system is closed under entailment; call this the box-rule). Most often, we will use the 0-ary case of this, which is that from “* |- A”, we can draw the judgement “* |- A”.
Ok. Let’s begin reasoning:
Now, for starters, clearly
(1) K |- M v T [from defining equation of K, by “conjunction elimination”]
Aka, from the teacher’s setup, we have that the quiz will be given on Monday or Tuesday
Thus,
(2) K & ~M |- T [from (1), disjunctive syllogism]
(3) * |- (K & ~M) -> T [(2), “implication introduction”]
(4) * |- ((K & ~M) -> T) [(3), box rule]
Aka, it is (student-)provable from the teacher’s setup and the quiz not being on Monday that the quiz will be on Tuesday
Also,
(6) K |- S -> ((M -> ~(K -> M)) & (T -> ~((K & ~M) -> T))) [defining equation of K, by &-elimination]
(7) K & S |- T -> ~((K & ~M) -> T) [(6), “implication elimination”]
(8) K & S |- ((K & ~M) -> T) *[from (4) and the trivial K & S |- , by transitivity of entailment]
(9) K & S |- ~T [(7) and (8), “modus tollens”]
And so, combining a bunch of trivial steps,
(10) K & S |- M [(1), K & S |- K (by &-elim), transitivity of |-, v-syllogism]
Aka, the teacher’s setup and the supposition that the student can only prove true things entails that the quiz is on Monday
At this point there may be some controversy already, but it seems reasonable to me. Going a tiny bit further, we also have
(11) * |- ((K & S) -> M) [(10), impl. intro, box rule]
Aka, no matter what, the student can prove that, from the teacher’s setup and the supposition that the student can only prove true things, it follows that the quiz is on Monday. [Of course; we just proved it as (10), and the (0-ary) box-rule says the student can prove whatever we can]
However, can we go any further? Can we actually obtain * |- (K -> M), for example? No, not from just what’s been given above. We’re at a roadblock to make that move. [Go ahead, try it; you’ll be unable to. Metamathematical argument providable upon request; this is incidentally the first point at which it matters what specific proposition S is]
So, we can demonstrate that the student can definitely determine, from the teacher’s setup and the assumption of student-soundness, that the quiz will be on Monday. However, we cannot get rid of that bit about the assumption of student-soundness; we haven’t assumed that the student can prove their own soundness, and so we don’t have that the student can definitely determine, purely from the teacher’s setup and no additional premises, that the quiz will be on Monday. So even if the quiz does come on Monday, it will count as a surprise, since the student was not able to predict this purely from the teacher’s setup. S
Well, moving forward, let’s analyze what happens in those cases where student-soundness is student-provable (some might even take this as part of any decent use of the word “proof”). I will put this in the next post.