An invariance notion in recursion theory

DOI10.2307/2273381zbMath0487.03021OpenAlexW2064932740MaRDI QIDQ3947651

Robert Byerly

Publication date: 1982

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

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

zbMATH Keywords

automorphismspartial recursive functionsGoedel numbersinvariant recursively enumerable sets

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Some properties of invariant sets ⋮ Definability of r. e. sets in a class of recursion theoretic structures ⋮ Recursion theory and the lambda-calculus

Cites Work

• Periodicity in generations of automata
• Post's problem and his hypersimple set
• Unnamed Item

This page was built for publication: An invariance notion in recursion theory