Complexity classes and theories of finite models
- 1 December 1981
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 15 (1) , 127-144
- https://doi.org/10.1007/bf01786976
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Almost sure theoriesAnnals of Mathematical Logic, 1980
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- Turing machines and the spectra of first-order formulasThe Journal of Symbolic Logic, 1974
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit IdentitätMathematical Logic Quarterly, 1955