If Godot falls in the forest and no one is around…
I took my Symbolic Logic test today. The first three pages were fine, just translations, truth tables, DeMorgan’s Laws, and a proof step proof (no subproofs). I finished in 15 minutes.
Then there were the proof method proofs (aka proofs with subproofs embedded).
There were four on the test; we had to choose two and prove them. I proved one relatively quickly (because it was essentially the definition of a biconditional), but then I literally sat there for 45 minutes just staring the other three down, racking my brain to try to figure out whether or not I could figure out how to prove one.
Finally, the lightbulb came on with one and I crapped out a proof in under 10 minutes (not easy, trust me).
So I got home and tried plugging my solution into Fitch, and if I did it the way I think I did on the test, I got that one right.
Observe:
Yay? Maybe? I hope I did okay.