Upper bounds for the arithmetical degrees

DOI10.1016/0168-0072(85)90001-6zbMath0608.03014OpenAlexW2048019510MaRDI QIDQ1086229

Manuel Lerman

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0168-0072(85)90001-6

zbMATH Keywords

arithmetical setsarithmetical functionsgeneralized high/low hierarchyjumps of upper bounds

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Minimal upper bounds for arithmetical degrees ⋮ On some filters and ideals of the Medvedev lattice ⋮ Models of arithmetic and subuniform bounds for the arithmetic sets ⋮ 1998–99 Annual Meeting of the Association for Symbolic Logic ⋮ Minimal complementation below uniform upper bounds for the arithmetical degrees ⋮ Completions of PA: Models and enumerations of representable sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Degrees of Recursively Saturated Models
• Degrees joining to 0′
• Two theorems on degrees of models of true arithmetic
• Jumping to a Uniform Upper Bound
• Minimal degrees and the jump operator
• A minimal degree not realizing least possible jump
• A degree-theoretic definition of the ramified analytical hierarchy
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Uniform upper bounds on ideals of turing degrees
• Double jumps of minimal degrees
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• A note on the hyperarithmetical hierarchy
• Degrees in Which the Recursive Sets are Uniformly Recursive

This page was built for publication: Upper bounds for the arithmetical degrees