Pages that link to "Item:Q3374756"
From MaRDI portal
The following pages link to Theories of orders on the set of words (Q3374756):
Displaying 21 items.
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- Definability of closure operations in the \(h\)-quasiorder of labeled forests (Q619316) (← links)
- On the homomorphism order of labeled posets (Q634750) (← links)
- Definability in the \(h\)-quasiorder of labeled forests (Q1023296) (← links)
- On quasi orders of words and the confluence property (Q1276254) (← links)
- On sets of words of rank two (Q2333030) (← links)
- Labeled posets are universal (Q2472843) (← links)
- 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)
- A Gandy Theorem for Abstract Structures and Applications to First-Order Definability (Q3576061) (← links)
- Definability in the Infix Order on Words (Q3637247) (← links)
- (Q4302996) (← links)
- (Q4683860) (← links)
- The Subtrace Order and Counting First-Order Logic (Q5042249) (← links)
- (Q5089232) (← links)
- Definability of Recursive Predicates in the Induced Subgraph Order (Q5224502) (← links)
- Definability in First Order Theories of Graph Orderings (Q5283438) (← links)
- (Q5376657) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
- Preorder-constrained simulations for program refinement with effects (Q6666773) (← links)
