Pages that link to "Item:Q1040653"
From MaRDI portal
The following pages link to Definability in substructure orderings. I: Finite semilattices (Q1040653):
Displaying 14 items.
- Definability in the substructure ordering of simple graphs (Q259729) (← links)
- Definability in substructure orderings. II: Finite ordered sets (Q981680) (← links)
- Definability in the embeddability ordering of finite directed graphs (Q2264119) (← links)
- Definability in the embeddability ordering of finite directed graphs. II (Q2314424) (← links)
- Definability in the substructure ordering of finite directed graphs (Q2665828) (← 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)
- (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)
