{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:50:17Z","timestamp":1773820217368,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0168-0072(94)90084-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"157-193","source":"Crossref","is-referenced-by-count":12,"title":["Zero-one laws for modal logic"],"prefix":"10.1016","volume":"69","author":[{"given":"Joseph Y","family":"Halpern","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Kapron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)90084-1_BIB1","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979","journal-title":"Proc. 6th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0168-0072(94)90084-1_BIB2","author":"van Benthem","year":"1983"},{"key":"10.1016\/0168-0072(94)90084-1_BIB3","author":"Bollob'as","year":"1985"},{"key":"10.1016\/0168-0072(94)90084-1_BIB4","first-page":"123","article-title":"The Boolean formula value problem is in ALOGTIME","author":"Buss","year":"1987","journal-title":"Proc. 19th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0168-0072(94)90084-1_BIB5","first-page":"460","article-title":"Some algebraic and geometric computations in PSPACE","author":"Canny","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0168-0072(94)90084-1_BIB6","author":"Carnap","year":"1947"},{"key":"10.1016\/0168-0072(94)90084-1_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0001-8708(87)90019-3","article-title":"A logical approach to asymptotic combinatorics I: First-order properties","volume":"65","author":"Compton","year":"1987","journal-title":"Adv. in Math."},{"key":"10.1016\/0168-0072(94)90084-1_BIB8","first-page":"353","article-title":"0\u20131 laws in logic and combinatorics","author":"Compton","year":"1988"},{"key":"10.1016\/0168-0072(94)90084-1_BIB9","author":"Dreben","year":"1979"},{"key":"10.1016\/0168-0072(94)90084-1_BIB10","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"Vol. 7","author":"Fagin","year":"1974"},{"key":"10.1016\/0168-0072(94)90084-1_BIB11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"1","key":"10.1016\/0168-0072(94)90084-1_BIB12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.1016\/0168-0072(94)90084-1_BIB13","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0168-0072(94)90084-1_BIB14","first-page":"294","article-title":"Asymptotic conditional probabilities for first-order logic","author":"Grove","year":"1992","journal-title":"Proc. 24th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0168-0072(94)90084-1_BIB15","first-page":"17","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"2","author":"Glebski\u012d","year":"1969","journal-title":"Kibernetika"},{"key":"10.1016\/0168-0072(94)90084-1_BIB16","author":"Graham","year":"1989"},{"key":"10.1016\/0168-0072(94)90084-1_BIB17","article-title":"NP trees and Carnap's modal logic","author":"Gottlob","year":"1992"},{"key":"10.1016\/0168-0072(94)90084-1_BIB18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","article-title":"Complexity of the first-order theory of almost all structure","volume":"52","author":"Grandjean","year":"1983","journal-title":"Information and Control"},{"key":"10.1016\/0168-0072(94)90084-1_BIB19","first-page":"37","article-title":"Using reasoning about knowledge to analyze distributed systems","volume":"Vol. 2","author":"Halpern","year":"1987"},{"key":"10.1016\/0168-0072(94)90084-1_BIB20","author":"Hughes","year":"1968"},{"key":"10.1016\/0168-0072(94)90084-1_BIB21","author":"Hughes","year":"1984"},{"key":"10.1016\/0168-0072(94)90084-1_BIB22","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","article-title":"A guide to completeness and complexity for modal logics of knowledge and belief","volume":"54","author":"Halpern","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0168-0072(94)90084-1_BIB23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0890-5401(89)90055-2","article-title":"Definability with bounded number of bound variables","volume":"83","author":"Immerman","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/0168-0072(94)90084-1_BIB24","article-title":"Counterexample to the 0\u20131 law for existential monadic second-order logic","volume":"32","author":"Kaufmann","year":"1987"},{"key":"10.1016\/0168-0072(94)90084-1_BIB25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","article-title":"Asymptotic enumeration of partial orders on a finite set","volume":"205","author":"Kleitman","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"issue":"3","key":"10.1016\/0168-0072(94)90084-1_BIB26","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0168-0072(94)90084-1_BIB27","first-page":"425","article-title":"The decision problem for the probabilities of higher-order properties","author":"Kolaitis","year":"1987","journal-title":"Proc. 19th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0168-0072(94)90084-1_BIB28","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0890-5401(90)90065-P","article-title":"0\u20131 laws and decision problems for fragments of second-order logic","volume":"87","author":"Kolaitis","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/0168-0072(94)90084-1_BIB29","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/LICS.1990.113742","article-title":"0\u20131 laws for infinitary logics","author":"Kolaitis","year":"1990","journal-title":"Proc. 5th IEEE Symp. on Logic in Computer Science"},{"issue":"2","key":"10.1016\/0168-0072(94)90084-1_BIB30","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log-space complete for P","volume":"6","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"issue":"3","key":"10.1016\/0168-0072(94)90084-1_BIB31","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","article-title":"The computational complexity of provability in systems of modal propositional logic","volume":"6","author":"Ladner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(94)90084-1_BIB32","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/malq.19660120131","article-title":"On some completeness theorems in modal logic","volume":"12","author":"Makinson","year":"1966","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0168-0072(94)90084-1_BIB33","article-title":"Verification of temporal programs: the temporal framework","author":"Manna","year":"1981"},{"key":"10.1016\/0168-0072(94)90084-1_BIB34","first-page":"280","article-title":"The 0\u20131 law fails for the class of existential second-order G\u00f6del sentences with equality","author":"Pacholski","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0168-0072(94)90084-1_BIB35","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."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007294900841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007294900841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T21:51:31Z","timestamp":1621029091000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007294900841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":35,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0168007294900841"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)90084-1","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}