Article contents
Random models and the Gödel case of the decision problem
Published online by Cambridge University Press: 12 March 2014
Abstract
In a paper of 1933 Gödel 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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1983
References
REFERENCES
- 8
- Cited by