Upper bounds on ideals in the computably enumerable Turing degrees期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Upper bounds on ideals in the computably enumerable Turing degrees

Authors:	George Barmpalias,André Nies

Affiliation:	^a School of Mathematics, Statistics, and Computer Science, Victoria University, PO Box 600 Wellington, New Zealand ^b Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

Abstract:

Keywords:	03D25
本文献已被 ScienceDirect 等数据库收录！