A note on the well-formed formulas of a pure functional calculus of the first order

The purpose of this note is to use primitive recursive functions and predicates similar to those presented by Davis [2] to show the well-known result first proved by Godel in [3] that the well-formed formulas of a pure functional calculus form a recursive set. The technique shown in this paper immediately suggests a unique approach to Theorem proving using a computer.