Pages that link to "Item:Q5441125"

The following pages link to Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests (Q5441125):

Displaying 12 items.

• Fine hierarchies via Priestley duality (Q424549) (← links)
• Definability of closure operations in the \(h\)-quasiorder of labeled forests (Q619316) (← links)
• Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
• Definability in the \(h\)-quasiorder of labeled forests (Q1023296) (← links)
• On the Wadge reducibility of \(k\)-partitions (Q1044675) (← links)
• Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
• Complexity Issues for Preorders on Finite Labeled Forests (Q3091446) (← 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)
• (Q5089232) (← links)
• On the main scientific achievements of Victor Selivanov (Q6146819) (← links)