\(\Pi_1^0 \) classes, LR degrees and Turing degrees
type: Item
instance of: scholarly article
title: \(\Pi_1^0 \) classes, LR degrees and Turing degrees
zbMATH Open document ID: 1156.03040
author: George Barmpalias
author: Andrew E. M. Lewis
author: Frank Stephan
published in: Annals of Pure and Applied Logic
publication date: 2008-12-05T00:00:00Z
review text: The paper studies the interactions between a few recursion-theoretic notions including Turing reducibility, \(\Pi_1^0\) classes, hyperimmunity, and LR degrees.
reviewed by: Cristian S. Calude
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D80
zbMATH DE Number: 5378323
zbMATH Keywords: relative randomness
zbMATH Keywords: LR degree
zbMATH Keywords: \(\Pi_1^0\) class
zbMATH Keywords: Turing degree
MaRDI profile type: Publication
full work available at URL: j.apal.2008.06.004
OpenAlex ID: W2014288728
cites work: The ibT degrees of computably enumerable sets are not dense
cites work: Randomness, lowness and degrees
cites work: A Cappable Almost Everywhere Dominating Computably Enumerable Degree
cites work: RELATIVIZING CHAITIN'S HALTING PROBABILITY
cites work: Randomness and universal machines
cites work: Low for random reals and positive-measure domination
cites work: Lowness notions, measure and domination
cites work: Turing incomparability in Scott sets
cites work: Randomness and Computability: Open Questions
cites work: Lowness properties and randomness
cites work: Q5494235
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Classical recursion theory. Vol. II
cites work: A minimal degree not realizing least possible jump
cites work: Almost everywhere domination and superhighness
cites work: Recursively enumerable sets and degrees
cites work: Q5457305
DOI: 10.1016/J.APAL.2008.06.004
description: scientific article; zbMATH DE number 5378323