Pages that link to "Item:Q5224502"

The following pages link to Definability of Recursive Predicates in the Induced Subgraph Order (Q5224502):

Displayed 5 items.

• Definability in the embeddability ordering of finite directed graphs. II (Q2314424) ‎ (← links)
• Definability in the substructure ordering of finite directed graphs (Q2665828) ‎ (← links)
• Alternating complexity of counting first-order logic for the subword order (Q2687036) ‎ (← links)
• (Q4683860) ‎ (← links)
• (Q5089232) ‎ (← links)