Complexity results for classes of quantificational formulas
- 31 December 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 21 (3), 317-353
- https://doi.org/10.1016/0022-0000(80)90027-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the Gödel class with identityThe Journal of Symbolic Logic, 1981
- Description of restricted automata by first-order formulaeTheory of Computing Systems, 1975
- Linear sampling and the ∀∃∀ case of the decision problemThe Journal of Symbolic Logic, 1974
- 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
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Classification of $AEA$ formulas by letter atomsBulletin of the American Mathematical Society, 1962
- Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthaltenMathematische Annalen, 1933
- Über die Erfüllbarkeit gewisser ZählausdrückeMathematische Annalen, 1928
- Zum Entscheidungsproblem der mathematischen LogikMathematische Annalen, 1928