You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Let's write an automated theorem prover! A series of increasingly sophisticated automated theorem provers realized as Prolog-like language implementations using Warren's Abstract Machine.
This application is used for interactive proving of logical formulas. It supports propositional, intuitionist and predicate logic. It proves using natural deduction or sequent calculus. The proof is displayed as Gentzen or Fitch notation.