Minimal weak truth table degrees and computably enumerable Turing degrees /

Minimal weak truth table degrees and computably enumerable Turing degrees /

Saved in:

Bibliographic Details
Author / Creator:	Downey, R. G. (Rod G.), author.
Imprint:	Providence, RI : American Mathematical Society, 2020.
Description:	vii, 90 pages : illustrations ; 26 cm.
Language:	English
Series:	Memoirs of the American Mathematical Society, 0065-9266 ; number 1284 Memoirs of the American Mathematical Society ; no. 1284.
Subject:	Unsolvability (Mathematical logic) Recursively enumerable sets. Computable functions. Computable functions. Recursively enumerable sets. Unsolvability (Mathematical logic)
Format:	Print Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/12617462

Hidden Bibliographic Details
Other authors / contributors:	Ng, Keng Meng, author. Solomon, Reed, author.
ISBN:	9781470441623 1470441624 9781470461379
Notes:	"May 2020, volume 265, number 1284 (first of 7 numbers)." Includes bibliographical references (pages 89-90).
Summary:	"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."--Page vii, abstract.
Other form:	Online version: Downey, Rodney G. Minimal weak truth table degrees and computably enumerable Turing degrees Providence, RI : American Mathematical Society, 2020 9781470461379

Mansueto

Loading map link

Holdings details from Mansueto
Call Number:	QA1.A528 no.1284
c.1	To check availability consult the series record. Intellectual item Need help? - Ask a Librarian