Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Almost partial m-reducibility

Edit abstract data

Speaker: Katerina Petrova
Author(s): Katerina Petrova and Boris Solon
Slot: Thu, 11:40-12:00, Room 24 (col. 3)


New reducibility (the so-called apm-reducibility) of enumeration type which is
weaker than pm-reducibility is introduced in this paper. Initial segments of
the upper semilattice of apm-degrees are studied here.

websites: Arnold Beckmann 2008-06-11 Valid HTML 4.01! Valid CSS!