Abstract
It is shown that any recognizable set of finite N-free pomsets is axiomatizable in counting monadic second order logic. Differently from similar results by Courcelle, Kabanets, and Lapoire, we do not use MSO-transductions (i.e., one-dimensional interpretations), but two-dimensional interpretations of a generating tree in an N-free pomset. Then we have to deal with the new problem that set-quantifications over the generating tree are translated into quantifications over binary relations in the N-free pomset. This is solved by an adaptation of a result by Potthoff & Thomas on monadic antichain logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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 between definability and recognizability. Theoretical Comp. Science, 80:153–202, 1991.
B. Courcelle. Monadic second-order definable graph transductions: a survey. Theoretical Comp. Science, 126:53–75, 1994.
B. Courcelle and J.A. Makowsky. VR and HR graph grammars:A common algebraic framework compatible with monadic second order logic. In Graph transformations, 2000. cf. tfs.cs.tu-berlin.de/gratra2000/proceedings.html.
J.L. Gischer. The equational theory of pomsets. Theoretical Comp. Science, 61:199–224, 1988.
W. Hodges. Model Theory. Cambridge University Press, 1993.
H.J. Hoogeboom and P. ten Pas. Monadic second-order definable text languages. Theoretical Comp. Science, 30:335–354, 1997.
V. Kabanets. Recognizability equals definability for partial k-paths. In ICALP’97, Lecture Notes in Comp. Science vol. 1256, pages 805–815. Springer, 1997.
D. Kuske. Infinite series-parallel posets: logic and languages. In J. D. P. Rolim U. Montanari and E. Welzl, editors, ICALP 2000, Lecture Notes in Comp. Science vol. 1853, pages 648–662. Springer, 2000.
D. Kuske. A model theoretic proof of Büchi-type theorems and first-order logic for N-free pomsets. In A. Ferreira and H. Reichel, editors, STACS 2001, Lecture Notes in Comp. Science vol. 2010, pages 443–454. Springer, 2001.
D. Lapoire. Recognizability equals monadic second order definability, for sets of graphs of bounded tree width. In STACS’98, Lecture Notes in Comp. Science vol. 1373, pages 618–628. Springer, 1998.
K. Lodaya and P. Weil. Series-parallel languages and the bounded-width property. Theoretical Comp. Science, 237:347–380, 2000.
K. Lodaya and P. Weil. Rationality in algebras with a series operation. Information and Computation, 2001. To appear.
A. Potthoff. Modulo-counting quantifiers over finite trees. Theoretical Comp. Science, 126:97–112, 1994.
A. Potthoff and W. Thomas. Regular tree languages without unary symbols are star-free. In Z. Ésik, editor, Fundamentals of Computation Theory, Lecture Notes in Comp. Science vol. 710, pages 396–405. Springer, 1993.
W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, pages 389–455. Springer Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuske, D. (2002). Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-46011-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43453-5
Online ISBN: 978-3-540-46011-4
eBook Packages: Springer Book Archive