{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:53Z","timestamp":1761611213870},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664086"},{"type":"electronic","value":"9783540483403"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_28","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:04:52Z","timestamp":1184591092000},"page":"310-320","source":"Crossref","is-referenced-by-count":4,"title":["On the Structure of the Monadic Logic of the Binary Tree"],"prefix":"10.1007","author":[{"given":"D.","family":"Janin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Lenzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Undergraduate Texts in Mathematics. Springer-verlag, 1984."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"E. Emerson. Temporal and modal logic. In J. Van Leeuwen, editor, Handbook of Theor. Comp. Science (vol. B), pages 995\u20131072. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"28_CR3","unstructured":"R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, volume 7. SIAM-AMS, 1974."},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/malq.19970430402","volume":"43","author":"R. Fagin","year":"1997","unstructured":"R. Fagin. Comparing the power of monadic NP games. Mathematical Logic Quarterly, 43(4):431\u2013455, 1997.","journal-title":"Mathematical Logic Quarterly"},{"key":"28_CR5","unstructured":"T. Hafer. On the boolean closure of B\u00fcchi tree automaton definable sets of \u03c9-trees. Technical report, Aachener Infor. Ber. Nr. 87-16, RWTH Aachen, 1987."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"W. Hanf. Model-theoretic methods in the study of elementary logic. In L. Henkin J. Addison and A. Tarski, editors, The theory of models, pages 132\u2013145, Amsterdam, 1965. North Holland.","DOI":"10.1016\/B978-0-7204-2233-7.50020-4"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional \u03bc-calculus. Theoretical Comp. Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Comp. Science"},{"key":"28_CR8","volume-title":"The Mu-calculus and the Hierarchy Problem","author":"G. Lenzi","year":"1997","unstructured":"G. Lenzi. The Mu-calculus and the Hierarchy Problem. PhD thesis, Scuola Normale Superiore, Pisa, 1997."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"M. O. Rabin. Decidability of second order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141, 1969.","DOI":"10.2307\/1995086"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"M. O. Rabin. Weakly definable relations and special automata. In Mathematical Logic and Foundation of Set Theory. North Holland, 1970.","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"28_CR11","volume-title":"Mathematical Logic","author":"J. R. Shoenfield","year":"1967","unstructured":"J. R. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, Mass., 1967."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. Van Leeuwen, editor, Handbook of Theor. Comp. Science (vol. B), pages 133\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:24:42Z","timestamp":1558470282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}