Some More Minimal Pairs of α‐Recursively Enumerable Degrees

DOI10.1002/MALQ.19780242505zbMath0416.03044OpenAlexW2158246350MaRDI QIDQ3205223

Richard A. Shore

Publication date: 1978

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19780242505

zbMATH Keywords

alpha-recursively enumerable degreesexistence of a minimal pairrecursion theory on admissible ordinals

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory ⋮ On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0′ ⋮ On the jumps of the degrees below a recursively enumerable degree ⋮ Ordinal machines and admissible recursion theory

This page was built for publication: Some More Minimal Pairs of α‐Recursively Enumerable Degrees