Random models and the Gödel case of the decision problem-Reference-Cited by-同舟云学术

Random models and the Gödel case of the decision problem

Published:1983-12 Issue:4 Volume:48 Page:1120-1124
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Gurevich Yuri,Shelah Saharon

Abstract

AbstractIn 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.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference10 articles.

1. Complexity results for classes of quantificational formulas

2. �ber die Erf�llbarkeit derjenigen Z�hlausdr�cke, welche in der Normalform zwei benachbarte Allzeichen enthalten

3. Goldfarb Warren D. , Gurevich Yuri and Shelah Saharon , On the Gödel class with identity (in preparation).

4. Zum Entscheidungsproblem des logischen Funktionenkalküls

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of Maslov's class K̅;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Complexity Results for First-Order Two-Variable Logic with Counting;SIAM Journal on Computing;2000-01

3. 0–1 Laws for Fragments of Existential Second-Order Logic: A Survey;Lecture Notes in Computer Science;2000

4. Quantifiers and Logical Reductions;Springer Monographs in Mathematics;1995

5. Random models and solvable Skolem classes;Journal of Symbolic Logic;1993-09