Proof Machine for FOL (beta) 

Explanation of how the Proof Machine works for FOL. It is the complete system, including all quantifier and identity rules, properties and relations. The one restriction is that names and predicates must be short form, like G(p). If you find any bugs, send me an email at ischnee@uw.edu!