Upper and lower bounds for first order expressibility
- 1 August 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (1) , 76-98
- https://doi.org/10.1016/0022-0000(82)90011-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- Almost sure theoriesAnnals of Mathematical Logic, 1980
- Properties of almost all graphs and complexesJournal of Graph Theory, 1979
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- Maze recognizing automata and nondeterministic tape complexityJournal of Computer and System Sciences, 1973
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960