Computability in Europe 2006
Logical Approaches to Computational Barriers


Regular Talk:
The Dyment reducibility on the algebraic structures and on the families of subsets of $omega$


Speaker: Iskander Kalimullin
Slot: Array, 11:30-11:50, col. 1

Abstract

In the paper a positive reducibility on the special noncomputable
algebraic structures and the connected reducibilities on the families
of subsets of $\omega$ are studied. 


websites: Arnold Beckmann 2006-04-19