Complexity of counting first-order logic for the subword order
From MaRDI portal
Publication:5089232
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 7297889 (Why is no real title available?)
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- Decidability in the logic of subsequences and supersequences
- Definability in substructure orderings. I: Finite semilattices
- Definability in the Subword Order
- Definability in the \(h\)-quasiorder of labeled forests
- Definability of recursive predicates in the induced subgraph order
- Defining recursive predicates in graph orders
- Languages ordered by the subword order
- On Boolean combinations forming piecewise testable languages
- Ordering by Divisibility in Abstract Algebras
- Piecewise testable languages and nondeterministic automata
- The computational complexity of logical theories
- The subtrace order and counting first-order logic
- Theories of orders on the set of words
- Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
- Well-structured transition systems everywhere!
Cited in
(8)- The height of piecewise-testable languages with applications in logical complexity
- Complexity Results for First-Order Two-Variable Logic with Counting
- Existential Definability over the Subword Ordering
- First-order separation over countable ordinals
- The subtrace order and counting first-order logic
- Languages ordered by the subword order
- Alternating complexity of counting first-order logic for the subword order
- scientific article; zbMATH DE number 7297889 (Why is no real title available?)
This page was built for publication: Complexity of counting first-order logic for the subword order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089232)
