Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Arnborg, J. Lagergren, D. Seese. Easy problems for tree decomposable graphs. J. of Algorithms 12:308–340, 1991.
B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85:12–75, 1990
B. Courcelle. The monadic second-order logic of graphs V: On closing the gap beween definability and recognizability. Theoret. Comput. Sci. 80:153–202, 1991
B. Courcelle. The monadic second-order logic of graphs VI: On several representations of graphs by relational structures Discrete Applied Mathematics 54:117–149, 1994
B. Courcelle. The monadic second order logic of graphs X: Linear orders. Theoret. Comput. Sci. 160:87–143, 1996.
B. Courcelle. Basic notions of universal algebra; applications to formal language theory and graph grammars. Theoret. Comput. Sci. 163:1–54, 1996
B. Courcelle. The expression of graph properties and graph transformations in monadic-second-order logic. In Handbook of graph transformations, volume 1: Foundations, G.Rozenberg ed., 1997, in press.
B. Courcelle. On the expression of graph properties in some fragments of monadic-second-order logic. In Descriptive complexity and finite models, N. Immerman and Ph. Kolaitis eds., Contemporary Mathematics, AMS, 1997, in press.
B. Courcelle, M. Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109:49–82, 1993
R. Fagin. Generalized first-order spectra and polynomial time recognizable sets. In Complexity of Computation R. Karp ed., SIAM-AMS proceedings 7:43–73, 1974
R. Fagin. Finite model theory — a personal perspective. Theoret. Comput. Sci. 116:3–31, 1993
H. Gaifman. On local and non local properties. Logic Colloquium'81, J. Stern ed., North-Holland, pp. 105–135, 1982
N. Immerman. Languages that capture complexity classes. SIAM J. Comput. 16:760–778, 1987
D. Kaller. Definability equals recognizability of partial 3-trees. newblock Proceedings of WG'96, Como, Italy, Lecture Notes in Computer Science. 1997, to appear.
V. Kabanets. Recognizability equals definability for partial k-paths, 1996, Submitted
J. Makowsky Model theory and computer science: an appetizer. Chapter I.6 of Handbook of Logic in Computer Science, Vol. 1, S. Abramsky et al. eds., Oxford University Press, 1992.
J. Makowsky, Y. Pnueli, Arity vs. Alternation in second-order logic. Logical Foundations of Computer Science, A. Nerode, Y. Matiyasevich eds., Lecture Notes in Computer Science 813:240–252, 1994
D. Seese The structure of the models of decidable monadic theories of graphs. Ann. Pure Applied Logic 53:169–195, 1991
L. Stockmeyer The polynomial-time hierarchy. Theoret. Comput. Sci. 3:1–22, 1977
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1997). Finite model theory, universal algebra and graph grammars. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-63045-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63045-6
Online ISBN: 978-3-540-69065-8
eBook Packages: Springer Book Archive