{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:38:25Z","timestamp":1703187505961},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":10608,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1016\/0022-0000(84)90010-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"8-35","source":"Crossref","is-referenced-by-count":31,"title":["Complete problems in the first-order predicate calculus"],"prefix":"10.1016","volume":"29","author":[{"given":"David A.","family":"Plaisted","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90010-2_BIB1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90010-2_BIB2","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0022-0000(84)90010-2_BIB3","series-title":"Programming in PROLOG","author":"Clocksin","year":"1981"},{"key":"10.1016\/0022-0000(84)90010-2_BIB4","series-title":"Proceedings, Third Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(84)90010-2_BIB5","series-title":"Complexity of Computation","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","author":"Fagin","year":"1974"},{"key":"10.1016\/0022-0000(84)90010-2_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(84)90010-2_BIB7","series-title":"Nineteenth Annual Symposium on Foundations of Computer Science","first-page":"65","article-title":"One-way log tape reductions","author":"Hartmanis","year":"1978"},{"key":"10.1016\/0022-0000(84)90010-2_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hofcroft","year":"1979"},{"key":"10.1016\/0022-0000(84)90010-2_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90010-2_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90010-2_BIB11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/2272354","article-title":"Turing machines and the spectra of first-order formulas with equality","volume":"39","author":"Jones","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(84)90010-2_BIB12","series-title":"Eighteenth Annual Symposium on Foundations of Computer Science","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977"},{"key":"10.1016\/0022-0000(84)90010-2_BIB13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0022-0000(80)90027-6","article-title":"Complexity results for classes of quantificational formulas","volume":"21","author":"Lewis","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90010-2_BIB14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01786976","article-title":"Complexity classes and theories of finite models","volume":"15","author":"Lynch","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90010-2_BIB15","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0022-0000(84)90010-2_BIB16","series-title":"The Correctness Problem in Computer Science","first-page":"215","article-title":"Verification of concurrent programs: The temporal framework","author":"Manna","year":"1981"},{"key":"10.1016\/0022-0000(84)90010-2_BIB17","series-title":"Proceedings, Thirteenth Annual ACM Symposium on Theory of Computing","first-page":"238","article-title":"An Algorithm for the general Petri net reachability problem","author":"Mayr","year":"1981"},{"key":"10.1016\/0022-0000(84)90010-2_BIB18","series-title":"Proceedings, Eighth Annual ACM Symposium on Theory of Computing","first-page":"181","article-title":"Linear unification","author":"Paterson","year":"1976"},{"key":"10.1016\/0022-0000(84)90010-2_BIB19","series-title":"Proceedings, Eighteenth Annual Symposium on Foundations of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0022-0000(84)90010-2_BIB20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90010-2_BIB21","first-page":"227","article-title":"Automatic deduction with hyper-resolution","volume":"1","author":"Robinson","year":"1965","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/0022-0000(84)90010-2_BIB22","series-title":"Proceedings of the 14th ACM Symposium on Theory of Computing","first-page":"159","article-title":"The complexity of propositional linear temporal logics","author":"Sistla","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:39Z","timestamp":1550325099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0022000084900102"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90010-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}