Back to Results
First PageMeta Content
Turing degree / Recursively enumerable set / Turing reduction / Reduction / Structure / Order / Computability theory / Mathematics / Enumeration


DEFINABILITY VIA KALIMULLIN PAIRS IN THE STRUCTURE OF THE ENUMERATION DEGREES HRISTO A. GANCHEV† AND MARIYA I. SOSKOVA†‡
Add to Reading List

Document Date: 2013-01-04 08:54:41

Open Document

File Size: 349,32 KB

Share Result on Facebook

Company

N sA / Ge / /

Facility

Isaac Newton Institute / /

IndustryTerm

e-ideal / /

Organization

Institute for Mathematical Sciences / /

Person

MARIYA I. SOSKOVA / Ai / HRISTO A. GANCHEV / /

Position

second author / /

ProvinceOrState

Louisiana / /

SocialTag