Undecidability in Some Structures Related to Computation Theory

DOI10.1093/logcom/exn023zbMath1170.03023OpenAlexW2073423738MaRDI QIDQ3611729

Victor L. Selivanov

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn023

zbMATH Keywords

reducibilityundecidabilitydiscrete weak semilattice

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

On the main scientific achievements of Victor Selivanov ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the Wadge reducibility of \(k\)-partitions

This page was built for publication: Undecidability in Some Structures Related to Computation Theory