Browsing by Subject "Computability theory"

Sort by: Order: Results:

  • Classifying equivalence relations in the Ershov hierarchy 
    Bazhenov N.; Mustafa M.; San Mauro L.; Sorbi A.; Yamaleev M. (2020)
    © 2020, The Author(s). Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility ⩽ c. This gives rise ...
  • Elementary theories and hereditary undecidability for semilattices of numberings 
    Unknown author (2018)
    © 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree structures of all types has been the question of the decidability or undecidability of their first order theories. This ...

Search DSpace

Browse

My Account