When I took Logic for CS we were taught the Natural Deduction proof calculus, which mirrors the kind of proofs we do in maths. We had an exercise during the course to write out which ND inference rules were used in every step of some natural language math proof, and it really shows you how one sentence can pack 10 or more inference rules if you try to unpack it!
He also put a similar question on the test which had you first prove a theorem using natural language, and then you had to find the use of ND inference rules in your proof (that wasn't easy... even though you wrote the proof yourself).
He also put a similar question on the test which had you first prove a theorem using natural language, and then you had to find the use of ND inference rules in your proof (that wasn't easy... even though you wrote the proof yourself).