On \(n\)-tardy sets

DOI10.1016/J.APAL.2012.02.001zbMath1252.03100arXiv1101.0228OpenAlexW2963259647MaRDI QIDQ435200

Peter M. Gerdes, Karen Lange, Peter A. Cholak

Publication date: 11 July 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.0228

zbMATH Keywords

automorphisms\(n\)-tardy setsc.e. setsr.e. sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Post's program and incomplete recursively enumerable sets.
• Codable sets and orbits of computably enumerable sets
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
• The Δ₃⁰-automorphism method and noninvariant classes of degrees
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: On \(n\)-tardy sets