Tools

LEADER 03898cam 2200577 i 4500

001 ssj0002325186;

003 WaSeSS;

005 20240512155341.0;

006 m d ;

007 cr n ;

008 200627s2020 riua sb 000 0 eng d;

010 a| 2020023540;

020 a| 9781470441623q| (paperback);

020 z| 9781470461379q| (ebook);

035 a| (WaSeSS)ssj0002325186;

042 a| pcc;

049 a| EREEa| NEHH;

050 00 a| QA9.63b| .D695 2020;

082 00 a| 511.3/52| 23;

084 a| 03D25a| 03D28a| 03D302| msc;

100 1 a| Downey, R. G.q| (Rod G.)=| ^A407560;

245 10 a| Minimal weak truth table degrees and computably enumerable Turing degreesh| [electronic resource] /c| Rodney G. Downey, Keng Meng Ng, Reed Solomon.;

260 a| Providence, RI :b| American Mathematical Society,c| 2020.;

300 a| vii, 90 pages :b| illustrations ;c| 26 cm;

490 0 a| Memoirs of the American Mathematical Society,x| 0065-9266 ;v| number 1284;

500 a| "May 2020, volume 265, number 1284 (first of 7 numbers).";

504 a| Includes bibliographical references (pages 89-90).;

505 0 a| Informal construction -- Formal construction -- Limiting results.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Unsolvability (Mathematical logic)=| ^A75579;

650 0 a| Recursively enumerable sets.=| ^A361702;

650 0 a| Computable functions.=| ^A60697;

650 7 a| Mathematical logic and foundations -- Computability and recursion theory -- Recursively (computably) enumerable sets and degrees.2| msc;

650 7 a| Mathematical logic and foundations -- Computability and recursion theory -- Other Turing degree structures.2| msc;

650 7 a| Mathematical logic and foundations -- Computability and recursion theory -- Other degrees and reducibilities.2| msc;

655 0 a| Electronic books.=| ^A491897;

700 1 a| Ng, Keng Meng.?| UNAUTHORIZED;

700 1 a| Solomon, Reed.?| UNAUTHORIZED;

856 40 z| Full text available from Memoirs of the American Mathematical Societyu| https://go.openathens.net/redirector/ecu.edu?url=http%3A%2F%2Fwww.ams.org%2Fbooks%2Fmemo%2F1284;

856 40 z| Full text available from Ebook Central - Academic Completeu| https://ebookcentral.proquest.com/lib/eastcarolina/detail.action?docID=6229930;

880 6| 520-00a| "Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. For strong notions of reducibility, such as m-deducibility or truth table reducibility, it is possible for computably enumerable degrees to be minimal. For weaker notions of reducibility, such as weak truth table reducibility or Turing reducibility, it is not possible to combine these properties in a single degree. We consider how minimal weak truth table degrees interact with computably enumerable Turing degrees and obtain three main results. First, there are sets with minimal weak truth table degree which bound noncomputable computably enumerable sets under Turing reducibility. Second, no set with computable enumerable Turing degree can have minimal weak truth table degree. Third, no Δ02 set which Turing bounds a promptly simple set can have minimal weak truth table degree"--c| Provided by publisher.;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 5494604;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 5494604-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 9/14/2020x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 5494604-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 9/14/2020x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 5494604-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 9/14/2020x| EBOOKz| JERESOURCE;

Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.

Author/creator	Downey, R. G.
Other author	Ng, Keng Meng.
Other author	Solomon, Reed.
Format	Electronic
Publication Info	Providence, RI : American Mathematical Society, 2020.
Description	vii, 90 pages : illustrations ; 26 cm
Supplemental Content	Full text available from Memoirs of the American Mathematical Society
Supplemental Content	Full text available from Ebook Central - Academic Complete
Subjects	Unsolvability (Mathematical logic) Recursively enumerable sets. Computable functions.

Series	Memoirs of the American Mathematical Society, 0065-9266 ; number 1284
Contents	Informal construction -- Formal construction -- Limiting results.
General note	"May 2020, volume 265, number 1284 (first of 7 numbers)."
Bibliography note	Includes bibliographical references (pages 89-90).
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2020023540
ISBN	9781470441623 (paperback)
ISBN	(ebook)

Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.

Click here for more information about this title