Premium
Strong Minimal Covers for Recursively Enumerable Degrees
Author(s) -
Barry Cooper S.
Publication year - 1996
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19960420116
Subject(s) - recursively enumerable language , mathematics , recursively enumerable set , maximal set , turing , cover (algebra) , mathematics subject classification , subject (documents) , discrete mathematics , combinatorics , computer science , set (abstract data type) , programming language , mechanical engineering , library science , engineering
We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover. Mathematics Subject Classification: 03D30.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom