Logic after Goedel

This talk will briefly survey the epochal significance of Goedel's
major theorems in proof theory, model theory and theory of computation,
and then describe two extensions of that work: one, by myself, to the
representation of prime numbers and one by Saul Kripke, which shows
how post-Goedelian model theory can be used to prove the
incompleteness theorem without Goedel numbering or diagonalization.