This project is currently an implementation of a proof-checker. But it is planned to be extended; for example, to support algorithm extraction from intuitionistic proofs, which is considered to be an interesting feature.
For example: if "(forall x x + 6 = 7) and (x - 2 = 3)" is given, it will return that it is well-formed
It should probably be enhanced to handle such cases (which?)
For example: if "(forall x x + 6 = 7) and (x - 2 = 3)" is given, it will return that it is well-formed It should probably be enhanced to handle such cases (which?)