a1 Monash University Clayton 3168 Australia
This paper contains proofs of the compactness, completeness and Löwenheim-Skolem theorems for predicate logic, together with their application to nonstandard numbers; proofs of undecidability in predicate logic and number theory, and the Gödel incompleteness theorem.
(Received February 02 1976)
Subject classification (Amer. Math. Soc. (MOS), 1970)