-
Notifications
You must be signed in to change notification settings - Fork 5
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Are formulas with more than 3 quantifiers intentionally excluded? #14
Comments
I'm not actually maintaining this since I didn't write it. Maybe @frabjous has an answer. I now use carnap.io for everything since it can automatically grade student work. It does support arbitrary quantifier blocks. See https://carnap.io/shared/rzach@ucalgary.ca/Practice%20Problems%20VII.md (scroll to very end for a box for arbitrary proofs) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
First of all, thanks for your great project.
Given that all lowercase letters other than x, y and z are interpreted as names, it appears to me that proofs with formals with four quantifiers are impossible to express.
Eg Aw Ax Ay Az (Rwxyz) returns "not well formed".
Is there any way to avoid this? If not: I know this exceeds the scope of a github issue, but do you know of any proof checking software (FOL with Identity) that is easy enough to understand in which I can express these formulas?
Best wishes from Germany,
Johannes
The text was updated successfully, but these errors were encountered: