Undecidability in Weihrauch Degrees

DOI10.1007/978-3-642-13962-8_29zbMath1286.03143OpenAlexW1588310362MaRDI QIDQ3576213

Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_29

zbMATH Keywords

undecidabilityWeihrauch reducibilitylabeled forest1-quasiorder2-quasiorder

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Related Items (6)

The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the main scientific achievements of Victor Selivanov ⋮ Closed choice and a uniform low basis theorem ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Undecidability in Weihrauch Degrees