Suppose that E is a string built by concatenating the symbol

Suppose that E is a string built by concatenating the symbols that allow well-formed formulas of first-order logic to be built. Such symbols include, of course, the five truth-functional connectives (, , , , ¬) and the quantifier. Can one program a Raven-machine to decide whether or not E is in fact a well-formed formula of first-order logic? Rigorously justify your answer.

Solution

Universal quantifiers are often used with “implies” to form “rules”

from the given connectives --> is implies, <--> is biconditional, V - or , ^ - and and the other quantifier is not

program in raven mmachine to decide whether or not E is in fact a well formed formula for first order logic