The following pages link to Definability in the Subword Order (Q3576212):
Displayed 10 items.
- Complexity in Young's lattice (Q2668002) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- (Q4683860) (← links)
- The Subtrace Order and Counting First-Order Logic (Q5042249) (← links)
- (Q5089232) (← links)
- Definability in First Order Theories of Graph Orderings (Q5283438) (← links)
- (Q5376657) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)