Complete problems in the first-order predicate calculus
- 31 August 1984
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (1) , 8-35
- https://doi.org/10.1016/0022-0000(84)90010-2
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Complexity classes and theories of finite modelsTheory of Computing Systems, 1981
- AlternationJournal of the ACM, 1981
- An algorithm for the general Petri net reachability problemPublished by Association for Computing Machinery (ACM) ,1981
- Complexity results for classes of quantificational formulasJournal of Computer and System Sciences, 1980
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Turing machines and the spectra of first-order formulasThe Journal of Symbolic Logic, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965