Effective extendability and fixed-points

DOI10.1305/NDJFL/1093890819MaRDI QIDQ2552127zbMATH OpenOpenAlexFDO

Authors Thomas H. Payne

Publication date 1973

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093890819

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Cited in

(4)

• Effectively infinite classes of numberings and fixed point theorems
• Fixed point theorems for minimal numberings
• Recursion theorems in numbered sets
• On weakly pre-complete positive equivalences

This page was built for publication: Effective extendability and fixed-points

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