Random Models and the Godel Case of the Decision Problem
Gurevich, Yuri ; Shelah, Saharon
J. Symbolic Logic, Tome 48 (1983) no. 1, p. 1120-1124 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
In a paper of 1933 Godel proved that every satisfiable first-order $\forall^2\exists^\ast$ 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 $\forall^2\exists^\ast$ sentence.
Publié le : 1983-12-14
Classification:  
@article{1183741419,
     author = {Gurevich, Yuri and Shelah, Saharon},
     title = {Random Models and the Godel Case of the Decision Problem},
     journal = {J. Symbolic Logic},
     volume = {48},
     number = {1},
     year = {1983},
     pages = { 1120-1124},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741419}
}

Gurevich, Yuri; Shelah, Saharon. Random Models and the Godel Case of the Decision Problem. J. Symbolic Logic, Tome 48 (1983) no. 1, pp.  1120-1124. http://gdmltest.u-ga.fr/item/1183741419/