This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abrusci V.M., Mascari G.F.: A Logic of Recursion. Information and Computation 81 (1989) 168–226
Ajtai M., Fagin R/. (1990), Reachability is Harder for Directed than for Undirected Finite Graphs. The Journal of Symbolic Logic 55 (1990) 113–150.
Barwise K.J., Cooper R.: Generalized quantifiers and Natural Language. Linguistics and Philosophy 4 (1981) 159–219.
Barwise J., Feferman S.: Model Theoretic Logics. Springer, Berlin (1985).
Bergstra J.A., Terlouw J.: Standard Model Semantics for DSL A Data Type Specification Language. Acta Informatica 19 (1983) 97–113.
Berman L.: The Complexity of Logical Theories. Theoretical Computer Science 11 (1980) 71–77.
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).
Chandra A., Harel D.: Structures and Complexity of Relational Queris. Journal of Computer and Systems Science 25 (1982) 99–128.
Courcelle B.: The Monadic Second—Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Information and Computation 85 (1990) 12–75.
Cleaveland R., Hennessy M.: Testing Equivalence as a Bisimulation Equivalence. In: “Automatic Verification Methods for Finite State Systems (Sifakis J. ed.) Lecture Notes in Computer Science 407 Springer, Berlin 1989, 11–23
Cleaveland R., Parrow M., Steffen B.: The Concurrency Worbench. In: “Automatic Verification Methods for Finite State Systems (Sifakis J. ed.) Lecture Notes in Computer Science 407, Springer, Berlin 1989, 24–37
De Nicola R., Ferrari G.L.: Observational Logics and Concurrency Model. Technical Report TR-10/90 Università di Pisa (1990).
Fenstad J.E.: Logic and Natural Language Systems. In: H.-D. Ebbinghaus et al. eds: Logic Colloquium '87, North-Holland, Amsterdam 1989, 27–39.
Gerla G.: Pointless Metric Spaces. The Journal of Symbolic Logic 55 (1990) 207–219.
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).
Hafner T.: On the Expressive Completeness of CTL*. Technical Report. Schriften zur Informatik und angewandten Mathematik 123 (1986).
Hella L.: Definability Hierarchies of Generalized Quantifiers. Annals of Pure and Applied Logic 43 (1989) 235–271.
Hennessy M.C., Milner A.J.R.G.: Algebraic Laws for nondeterminism and concurrence. Journal of the Association of Computing Machinery 32 (1985) 137–161.
Immerman N.: Descriptive and Computational Complexity. Proceedings of Symposia in Applied Mathematics, Vol. 38, 75–91, Americal Mathematical Society, Providence (1989) 75–91.
Immerman N., Kozen D.: Definability with Bounded Number of Bound Variables, Information and Computation 83 (1989) 121–139.
Kolaitis P. and Papadimitriou C.H.: Some Computational Aspects of Circumscription, Journal of the Association of Computing Machinery 37 (1990) 1–14.
Ladner R.E.: Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata. Information and Control 33 (1977) 281–303.
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–230.
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–421.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mascari, G., Vincenzi, A. (1991). Model-theoretic specifications and back-and-forth equivalences. In: Ehrig, H., Jantke, K.P., Orejas, F., Reichel, H. (eds) Recent Trends in Data Type Specification. ADT 1990. Lecture Notes in Computer Science, vol 534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54496-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-54496-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54496-8
Online ISBN: 978-3-540-38416-8
eBook Packages: Springer Book Archive