Abstract
We study the subtrace relation among Mazurkiewicz traces which generalizes the much-studied subword order. Here, we consider the 2-variable fragment of a counting extension of first-order logic with regular predicates. It is shown that all definable trace languages are effectively recognizable implying that validity of a sentence of this logic is decidable (this problem is known to be undecidable for virtually all stronger logics already for the subword relation).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979)
Cartier, P., Foata, D.: Problemes combinatoires de commutation et rearrangements. Lecture Notes in Mathematics, vol. 85. Springer, Heidelberg (1969). https://doi.org/10.1007/BFb0079468
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific Publ. Co., London (1995)
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theoret. Comput. Sci. 256, 63–92 (2001)
Gastin, P., Petit, A.: Infinite traces. In: [3], pp. 393–486 (1995)
Halfon, S., Schnoebelen, Ph., Zetzsche, G.: Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: LICS 2017, pp. 1–12. IEEE Computer Society (2017)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 326–336 (1952)
Ježek, J., McKenzie, R.: Definability in substructure orderings. I: finite semilattices. Algebra Univers. 61(1), 59–75 (2009)
Karandikar, P., Schnoebelen, Ph.: Decidability in the logic of subsequences and supersequences. In: FSTTCS 2015, Leibniz International Proceedings in Informatics, vol. 45, pp. 84–97. Leibniz-Zentrum für Informatik (2015)
Karandikar, P., Schnoebelen, P.: The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15(2), 6:1–6:27 (2019)
Kudinov, O.V., Selivanov, V.L., Yartseva, L.V.: Definability in the subword order. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol. 6158, pp. 246–255. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13962-8_28
Kuske, D.: Theories of orders on the set of words. Theoret. Inf. Appl. 40, 53–74 (2006)
Kuske, D., Schwarz, Ch.: Complexity of counting first-order logic for the subword order (2020, in preparation)
Kuske, D., Zetzsche, G.: Languages ordered by the subword order. In: Bojańczyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 348–364. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17127-8_20
Madhusudan, P.: Model-checking trace event structures. In: LICS 2003, pp. 371–380. IEEE Computer Society Press (2003)
Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)
McKnight, J.: Kleene’s quotient theorems. Pac. J. Math. XIV, 1343–1352 (1964)
Shelah, S.: The monadic theory of order. Ann. Math. 102, 379–419 (1975)
Thinniyam, R.S.: Defining recursive predicates in graph orders. Log. Methods Comput. Sci. 14(3), 1–38 (2018)
Thomas, W.: On logical definability of trace languages. In: Diekert, V. (ed.) Proceedings of a workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, pp. 172–182 (1990)
Wires, A.: Definability in the substructure ordering of simple graphs. Ann. Comb. 20(1), 139–176 (2016). https://doi.org/10.1007/s00026-015-0295-4
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Kuske, D. (2020). The Subtrace Order and Counting First-Order Logic. In: Fernau, H. (eds) Computer Science – Theory and Applications. CSR 2020. Lecture Notes in Computer Science(), vol 12159. Springer, Cham. https://doi.org/10.1007/978-3-030-50026-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-50026-9_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-50025-2
Online ISBN: 978-3-030-50026-9
eBook Packages: Computer ScienceComputer Science (R0)