DEFINING TOTALITY IN THE ENUMERATION DEGREES MINGZHONG CAI, HRISTO A. GANCHEV, STEFFEN LEMPP, JOSEPH S. MILLER, AND MARIYA I. SOSKOVA Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-compu - Enumeration - Document - PDFSEARCH.IO

First Page	Meta Content
	DEFINING TOTALITY IN THE ENUMERATION DEGREES MINGZHONG CAI, HRISTO A. GANCHEV, STEFFEN LEMPP, JOSEPH S. MILLER, AND MARIYA I. SOSKOVA Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-compu Add to Reading List Document Date: 2014-01-28 17:21:47 Open Document File Size: 301,75 KB Share Result on Facebook Country Russia / United States / Bulgaria / Kazakhstan / / IndustryTerm e-ideals / few partial solutions / / NaturalFeature Mt Mt+1 / / Organization National Science Foundation / c.e. / / Person MARIYA I. SOSKOVA / STEFFEN LEMPP / JOSEPH S. MILLER / HRISTO A. GANCHEV / / Position author / first author / / SocialTag Mathematical logic Field extension Rational number Computability theory Primitive recursive function Mathematics Field theory Enumeration

DEFINING TOTALITY IN THE ENUMERATION DEGREES MINGZHONG CAI, HRISTO A. GANCHEV, STEFFEN LEMPP, JOSEPH S. MILLER, AND MARIYA I. SOSKOVA Abstract. We show that if A and B form a nontrivial K-pair, then there is a semi-compuAdd to Reading List