Exercise 7

Published

October 21, 2026

1 parser and is_formula

Revisit is_formula and parser from exercise 4, and convince yourself you could implement similar functions for first order logic (given a particular language with all the constants, functions, relations and their arities).

2 Exercises from Cook’s Notes

2.1

Do exercises 2-10 and 15 from here.

Note the differences in notation.

  • \(\supset\) is \(\to\) (implication in the object language).
  • \(\LRA\) is \(\equiv\) (logical equivalance).
  • They use “vocabulary” where we use “language”.