{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:53:00Z","timestamp":1752231180758},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023761","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"111-118","source":"Crossref","is-referenced-by-count":2,"title":["On bounded theories"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Flum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0890-5401(87)90051-4","volume":"72","author":"A. Amir","year":"1978","unstructured":"Amir, A., Gabbay, D.: Preservation of expressive completeness in temporal models, Information and Computation 72(1978), 66\u201383.","journal-title":"Information and Computation"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/2272133","volume":"42","author":"J. Barwise","year":"1977","unstructured":"Barwise, J.: On Moschovakis closure ordinals, J.Symb.Log. 42(1977), 292\u2013296.","journal-title":"J.Symb.Log."},{"key":"8_CR3","first-page":"248","volume":"499","author":"J. Flum","year":"1975","unstructured":"Flum, J.: First-order logic and its extensions, ISILC Logic Conf. Kiel, Lect. Notes in Math. 499(1975), 248\u2013310.","journal-title":"ISILC Logic Conf. Kiel, Lect. Notes in Math."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-94-009-8384-7_4","volume-title":"Aspects of Philosophical Logic","author":"D. Gabbay","year":"1981","unstructured":"Gabbay, D.: Expressive functional completeness in tense logic, in \u201cAspects of Philosophical Logic\u201d (Monnich, Ed.), Reidel, Dordrecht (1981), 91\u2013117."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","volume":"25","author":"N. Immerman","year":"1982","unstructured":"Immerman, N.: Upper and lower bounds for first-order expressibility, J.Comp.Syst.Sciences 25(1982), 76\u201398.","journal-title":"J.Comp.Syst.Sciences"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0890-5401(89)90055-2","volume":"83","author":"N. Immerman","year":"1989","unstructured":"Immerman, N., Kozen, D.: Definability with a bounded number of bound variables, Information and Computation 83(1989), 121\u2013139.","journal-title":"Information and Computation"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-1-4612-4478-3_5","volume-title":"Complexity Theory Retrospective","author":"N. Immerman","year":"1990","unstructured":"Immerman, N., Lander, E.: Describing graphs: A first-order approach to Graph Canonization, in: A.Selman (Ed.), Complexity Theory Retrospective, Springer, New York (1990), 59\u201381."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"641","DOI":"10.2307\/2273594","volume":"47","author":"B. Poizat","year":"1982","unstructured":"Poizat, B.: Deux ou trois choses que je sais de L\nn, J.Symb.Log. 47(1982), 641\u2013658.","journal-title":"J.Symb.Log."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023761.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:29Z","timestamp":1607550629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0023761","relation":{},"subject":[]}}