Definability of r. e. sets in a class of recursion theoretic structures

DOI10.2307/2273458zbMath0528.03031OpenAlexW2073377134MaRDI QIDQ3309828

Robert Byerly

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273458

zbMATH Keywords

definabilityacceptable enumerationacceptable structureapplication operationGoedel numbers of partial recursive functionsnumber-theoretic properties of Goedel numbers

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Interpolation, preservation, definability (03C40) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Unnamed Item
• An invariance notion in recursion theory
• Post's problem and his hypersimple set
• The Friedberg-Muchnik Theorem Re-Examined

This page was built for publication: Definability of r. e. sets in a class of recursion theoretic structures