Definability in the Subword Order
From MaRDI portal
Recommendations
- Definability in the Infix Order on Words
- Definability in substructure orderings. I: Finite semilattices
- Definability in the structure of words with the inclusion relation
- Definability in substructure orderings. II: Finite ordered sets
- Definability of recursive predicates in the induced subgraph order
- scientific article; zbMATH DE number 4195916
- On the definability of verbal subgroups
- Definability in the substructure ordering of finite directed graphs
- scientific article; zbMATH DE number 7297889
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Cited in
(15)- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- A property of sentences that define quasi-order
- Complexity in Young's lattice
- Alternating complexity of counting first-order logic for the subword order
- Well-Quasi Orders and Hierarchy Theory
- Theories of orders on the set of words
- Definability in the Infix Order on Words
- Defining recursive predicates in graph orders
- The subtrace order and counting first-order logic
- Complexity of counting first-order logic for the subword order
- Definability in first order theories of graph orderings
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- Definability in the structure of words with the inclusion relation
- On the main scientific achievements of Victor Selivanov
- Existential Definability over the Subword Ordering
This page was built for publication: Definability in the Subword Order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576212)