- #1
blackdvl666
- 1
- 0
ok guys this is from my logics course!
this question may be very simple but i am just gettin stuck
give a recursive definition of the length of a well formed formula that is of the number of the symbols occurring in it. For example length of (p^(~q)) is 8.
this question may be very simple but i am just gettin stuck
give a recursive definition of the length of a well formed formula that is of the number of the symbols occurring in it. For example length of (p^(~q)) is 8.