A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Random models and the Maslov class

1989
*
Journal of Symbolic Logic (JSL)
*

In [GS] Gurevich and Shelah introduce a novel method for proving that every satisfiable formula in the Gödel class has a finite model (the Gödel class is the class of prenex formulas of pure quantification theory with prefixes ∀∀∃ ... ∃). They dub their method "random models": it proceeds by delineating, given any F in the Gödel class and any integer p, a set of structures for F with universe {1, ..., p} that can be treated as a finite probability space S. They then show how to calculate an

doi:10.2307/2274860
fatcat:u655uxz74nhglodkldbsfhnk7y