Complexity of the first-order theory of almost all finite structures
- 30 June 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 57 (2-3), 180-204
- https://doi.org/10.1016/s0019-9958(83)80043-6
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- AlternationJournal of the ACM, 1981
- Almost sure theoriesAnnals of Mathematical Logic, 1980
- The complexity of logical theoriesTheoretical Computer Science, 1980
- On time-space classes and their relation to the theory of real additionTheoretical Computer Science, 1980
- Properties of almost all graphs and complexesJournal of Graph Theory, 1979
- An efficient decision procedure for the theory of rational orderTheoretical Computer Science, 1977
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- A spectrum hierarchyMathematical Logic Quarterly, 1975
- Concerning measures in first order calculiIsrael Journal of Mathematics, 1964