乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:15Z","timestamp":1725663795199},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544968"},{"type":"electronic","value":"9783540384168"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54496-8_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:55:38Z","timestamp":1330210538000},"page":"166-184","source":"Crossref","is-referenced-by-count":0,"title":["Model-theoretic specifications and back-and-forth equivalences"],"prefix":"10.1007","author":[{"given":"Gianfranco","family":"Mascari","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Vincenzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0890-5401(89)90069-2","volume":"81","author":"V.M. Abrusci","year":"1989","unstructured":"Abrusci V.M., Mascari G.F.: A Logic of Recursion. Information and Computation 81 (1989) 168\u2013226","journal-title":"Information and Computation"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2274958","volume":"55","author":"M. Ajtai","year":"1990","unstructured":"Ajtai M., Fagin R\/. (1990), Reachability is Harder for Directed than for Undirected Finite Graphs. The Journal of Symbolic Logic 55 (1990) 113\u2013150.","journal-title":"The Journal of Symbolic Logic"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00350139","volume":"4","author":"K.J. Barwise","year":"1981","unstructured":"Barwise K.J., Cooper R.: Generalized quantifiers and Natural Language. Linguistics and Philosophy 4 (1981) 159\u2013219.","journal-title":"Linguistics and Philosophy"},{"key":"9_CR4","volume-title":"Model Theoretic Logics","author":"J. Barwise","year":"1985","unstructured":"Barwise J., Feferman S.: Model Theoretic Logics. Springer, Berlin (1985)."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00263930","volume":"19","author":"J.A. Bergstra","year":"1983","unstructured":"Bergstra J.A., Terlouw J.: Standard Model Semantics for DSL A Data Type Specification Language. Acta Informatica 19 (1983) 97\u2013113.","journal-title":"Acta Informatica"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","volume":"11","author":"L. Berman","year":"1980","unstructured":"Berman L.: The Complexity of Logical Theories. Theoretical Computer Science 11 (1980) 71\u201377.","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Mauri G., Miglioli P.: Some uses of Model Theory to specify abstracts data types and to capture their recursiveness. Fundamenta Informaticae, VI.2 (1983).","DOI":"10.3233\/FI-1983-6202"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"Chandra A., Harel D.: Structures and Complexity of Relational Queris. Journal of Computer and Systems Science 25 (1982) 99\u2013128.","journal-title":"Journal of Computer and Systems Science"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle B.: The Monadic Second\u2014Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Information and Computation 85 (1990) 12\u201375.","journal-title":"Information and Computation"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-52148-8_2","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland R., Hennessy M.: Testing Equivalence as a Bisimulation Equivalence. In: \u201cAutomatic Verification Methods for Finite State Systems (Sifakis J. ed.) Lecture Notes in Computer Science 407 Springer, Berlin 1989, 11\u201323","journal-title":"Lecture Notes in Computer Science"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-52148-8_3","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland R., Parrow M., Steffen B.: The Concurrency Worbench. In: \u201cAutomatic Verification Methods for Finite State Systems (Sifakis J. ed.) Lecture Notes in Computer Science 407, Springer, Berlin 1989, 24\u201337","journal-title":"Lecture Notes in Computer Science"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"De Nicola R., Ferrari G.L.: Observational Logics and Concurrency Model. Technical Report TR-10\/90 Universit\u00e0 di Pisa (1990).","DOI":"10.1007\/3-540-53487-3_53"},{"key":"9_CR13","first-page":"27","volume-title":"Logic Colloquium '87","author":"J.E. Fenstad","year":"1989","unstructured":"Fenstad J.E.: Logic and Natural Language Systems. In: H.-D. Ebbinghaus et al. eds: Logic Colloquium '87, North-Holland, Amsterdam 1989, 27\u201339."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/2274963","volume":"55","author":"G. Gerla","year":"1990","unstructured":"Gerla G.: Pointless Metric Spaces. The Journal of Symbolic Logic 55 (1990) 207\u2013219.","journal-title":"The Journal of Symbolic Logic"},{"key":"9_CR15","unstructured":"Goguen J.A. and Burstall R.M.: Institutions: Abstract Model Theory for Computer Science. Report No. CSLI-85-30 Center for the Study of Language and Information, Stanford University (1985)."},{"key":"9_CR16","unstructured":"Hafner T.: On the Expressive Completeness of CTL*. Technical Report. Schriften zur Informatik und angewandten Mathematik 123 (1986)."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(89)90070-5","volume":"43","author":"L. Hella","year":"1989","unstructured":"Hella L.: Definability Hierarchies of Generalized Quantifiers. Annals of Pure and Applied Logic 43 (1989) 235\u2013271.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M.C. Hennessy","year":"1985","unstructured":"Hennessy M.C., Milner A.J.R.G.: Algebraic Laws for nondeterminism and concurrence. Journal of the Association of Computing Machinery 32 (1985) 137\u2013161.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/psapm\/038\/1020810","volume":"38","author":"N. Immerman","year":"1989","unstructured":"Immerman N.: Descriptive and Computational Complexity. Proceedings of Symposia in Applied Mathematics, Vol. 38, 75\u201391, Americal Mathematical Society, Providence (1989) 75\u201391.","journal-title":"Proceedings of Symposia in Applied Mathematics"},{"key":"9_CR20","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 Bounded Number of Bound Variables, Information and Computation 83 (1989) 121\u2013139.","journal-title":"Information and Computation"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/78935.78936","volume":"37","author":"P. Kolaitis","year":"1990","unstructured":"Kolaitis P. and Papadimitriou C.H.: Some Computational Aspects of Circumscription, Journal of the Association of Computing Machinery 37 (1990) 1\u201314.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0019-9958(77)90443-0","volume":"33","author":"R.E. Ladner","year":"1977","unstructured":"Ladner R.E.: Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata. Information and Control 33 (1977) 281\u2013303.","journal-title":"Information and Control"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-15199-0_14","volume-title":"TAPSOFT '85","author":"T.S.E. Maibaum","year":"1985","unstructured":"Maibaum T.S.E., Veloso P.A.S., Sadler M.R.: A Theory of Abstract Data Types for Program Development: Bridging the Gap? In: Ehrig H., Floyd C., Nivat M., Thatcher J. eds.: TAPSOFT '85,, Lecture Notes in Computer Science, Springer, Berlin 1985, Vol. 2o, 214\u2013230."},{"key":"9_CR24","series-title":"Lectures Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-10003-2_88","volume-title":"Automata, Languages and Programming","author":"J.A. Makowsky","year":"1980","unstructured":"Makowsky J.A.: Measuring the expressive power of dynamic logics: An application of abstract model theory. In: de Bakker W., van Leeuwen J. eds.:, Automata, Languages and Programming,, Lectures Notes in Computer Science 85, Springer, Berlin 1980, 409\u2013421."}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Data Type Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54496-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:51:13Z","timestamp":1640922673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54496-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544968","9783540384168"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-54496-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}