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

DOI10.2307/2273458MaRDI QIDQ3309828zbMATH OpenOpenAlexFDO

Authors 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

acceptable enumerationacceptable structureapplication operationdefinabilityGoedel numbers of partial recursive functionsnumber-theoretic properties of Goedel numbers

Mathematics Subject Classification ID

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

Cites work

• An invariance notion in recursion theory
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309828)