Abstract

In a paper of 1933 Godel proved that every satisfiable first-order ∀ 2 ∃ * sentence has a finite model. Actually he constructed a finite model in an ingenious and sophisticated way. In this paper we use a simple and straightforward probabilistic argument to establish existence of a finite model of an arbitrary satisfiable ∀ 2 ∃ * sentence