{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:19Z","timestamp":1761611119883},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8751,"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":[[1989,8]]},"DOI":"10.1016\/0022-0000(89)90019-6","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"51-83","source":"Crossref","is-referenced-by-count":34,"title":["Descriptive characterizations of computational complexity"],"prefix":"10.1016","volume":"39","author":[{"given":"Daniel","family":"Leivant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90019-6_BIB1","series-title":"Sixth Symposium on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0022-0000(89)90019-6_BIB2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.2307\/2270906","article-title":"Applications of strict \u03a011 predicates to infnitary logic","volume":"34","author":"Barwise","year":"1969","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(89)90019-6_BIB3","series-title":"Admissible Sets and Structures","author":"Barwise","year":"1975"},{"key":"10.1016\/0022-0000(89)90019-6_BIB4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.2307\/2271519","article-title":"The next admissible set","volume":"36","author":"Barwise","year":"1971","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(89)90019-6_BIB5","first-page":"1","article-title":"Henkin quantifiers and complete problems","volume":"32","author":"Blass","year":"1986","journal-title":"Theoret. Comput. Sc."},{"key":"10.1016\/0022-0000(89)90019-6_BIB6","series-title":"Nineteenth Annual Symposium on Foundations of Computer Science","first-page":"132","article-title":"On the power of the compass","author":"Blum","year":"1978"},{"key":"10.1016\/0022-0000(89)90019-6_BIB7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2273529","article-title":"Global inductive definability","volume":"43","author":"Barwise","year":"1978","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(89)90019-6_BIB8","series-title":"Logic Colloquium '82","first-page":"263","article-title":"Decision problems in predicate logic","author":"B\u00f6rger","year":"1984"},{"key":"10.1016\/0022-0000(89)90019-6_BIB9","series-title":"Proceedings, Second Annual Conference on Structure in Complexity","first-page":"94","article-title":"PSPACE survives three-bit bottlenecks","author":"Cai","year":"1987"},{"key":"10.1016\/0022-0000(89)90019-6_BIB10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational data bases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90019-6_BIB11","article-title":"Spektren and Klassen elementarer Funktionen","author":"Christen","year":"1974"},{"key":"10.1016\/0022-0000(89)90019-6_BIB12","series-title":"Introduction to Mathematical Logic","author":"Church","year":"1956"},{"key":"10.1016\/0022-0000(89)90019-6_BIB13","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(89)90019-6_BIB14","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(89)90019-6_BIB15","series-title":"General Recursion Theory","author":"Fenstad","year":"1980"},{"key":"10.1016\/0022-0000(89)90019-6_BIB16","series-title":"Logic Colloquium'69","first-page":"113","article-title":"Axiomatic recursive function theory","author":"Friedman","year":"1971"},{"key":"10.1016\/0022-0000(89)90019-6_BIB17","series-title":"Twenty-fourth Symposium on Foundations of Computer Science","first-page":"210","article-title":"Algebras of feasible functions","author":"Gurevich","year":"1983"},{"key":"10.1016\/0022-0000(89)90019-6_BIB18","series-title":"Current Trends in Theoretical Computer Science","article-title":"Logic and the Challenge of Computer Science","author":"Gurevich","year":"1987"},{"key":"10.1016\/0022-0000(89)90019-6_BIB19","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF00289513","article-title":"On nondeterminacy in simple computing devices","volume":"1","author":"Hartmanis","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(89)90019-6_BIB20_1","series-title":"Proceedings, Second Conference on Structure in Complexity Theory","first-page":"110","article-title":"The sky is falling: The strong exponential hierarchy collapses","author":"Hemachandra","year":"1987"},{"key":"10.1016\/0022-0000(89)90019-6_BIB20_2","author":"Hemachandra","year":"1986"},{"key":"10.1016\/0022-0000(89)90019-6_BIB21","series-title":"Infinitistic Methods","first-page":"167","article-title":"Some remarks on infinitely long formulas","author":"Henkin","year":"1961"},{"key":"10.1016\/0022-0000(89)90019-6_BIB22","series-title":"Complexity if Computation","first-page":"1","article-title":"The LBA problem and its importance in the theory of computing","volume":"Vol. VII","author":"Hartmanis","year":"1974"},{"key":"10.1016\/0022-0000(89)90019-6_BIB23","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0019-9958(84)80045-5","article-title":"A programming language for the inductive sets, and applications","volume":"63","author":"Harel","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90019-6_BIB24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0022-0000(81)90039-8","article-title":"Number of quantifiers is better than number of tape cells","volume":"22","author":"Immerman","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90019-6_BIB25_1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90019-6_BIB25_2","series-title":"Fourteenth ACM Symposium on Theory of Computing","first-page":"147","author":"Immerman","year":"1982"},{"key":"10.1016\/0022-0000(89)90019-6_BIB26","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages which capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90019-6_BIB27_1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/2272354","article-title":"Turing machines and the spectra of first-order formulas","volume":"39","author":"Jones","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(89)90019-6_BIB27_2","series-title":"Fourth ACM Symposium on Theory of Computing","author":"Jones","year":"1972"},{"key":"10.1016\/0022-0000(89)90019-6_BIB28","doi-asserted-by":"crossref","first-page":"318","DOI":"10.2307\/2269621","article-title":"Metarecursive sets","volume":"30","author":"Kreisel","year":"1965","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(89)90019-6_BIB29","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(89)90019-6_BIB30","series-title":"Subrecursion, Functions and Hierarchies","author":"Rose","year":"1984"},{"key":"10.1016\/0022-0000(89)90019-6_BIB31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/malq.19870330107","article-title":"Second-order and inductive definability on finite structures","volume":"33","author":"de Rougemont","year":"1987","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0022-0000(89)90019-6_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90019-6_BIB33","first-page":"705","article-title":"Some notions and methods on the borderline of algebra and metamathematics","volume":"Vol. I","author":"Tarski","year":"1952"},{"key":"10.1016\/0022-0000(89)90019-6_BIB34","series-title":"Fourteenth Symposium on Theory of Computing","first-page":"137","article-title":"Complexity and relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0022-0000(89)90019-6_BIB35","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2307\/2271440","article-title":"Finite partially ordered quantification","volume":"35","author":"Walkoe","year":"1970","journal-title":"J. Symbolic Logic"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900196?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:55:06Z","timestamp":1550325306000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0022000089900196"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90019-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}