Pages that link to "Item:Q5898827"

The following pages link to Logical Approaches to Computational Barriers (Q5898827):

Displaying 13 items.

• Definability of closure operations in the \(h\)-quasiorder of labeled forests (Q619316) (← links)
• On the homomorphism order of labeled posets (Q634750) (← links)
• Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
• Definability in the \(h\)-quasiorder of labeled forests (Q1023296) (← links)
• Labeled posets are universal (Q2472843) (← links)
• Complexity Issues for Preorders on Finite Labeled Forests (Q3091446) (← links)
• Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
• The quotient algebra of labeled forests modulo h-equivalence (Q3546077) (← links)
• On the Wadge Reducibility of k-Partitions (Q4918030) (← links)
• Hierarchies of Δ⁰₂‐measurable <i>k</i> ‐partitions (Q5307611) (← links)
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests (Q5425345) (← links)
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests (Q5441125) (← links)
• On the main scientific achievements of Victor Selivanov (Q6146819) (← links)