The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
0-1 laws and decision problems for fragments of second-order logic
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
The 0-1 law fails for the class of existential second order Godel sentences with equality
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
The Σ11(∀∃∀) class is the class of all existential second-order sentences whose first-order part is in the prenex form with prefix of the form ∀∃∀. In this paper we prove that every rational number in the interval [0,1] is the asymptotic probability for some Σ11(∀∃∀) sentence. This result completes the classification of asymptotic probabilities for the existential second-order minimal classes.