General computability

DOI10.1305/NDJFL/1093883047MaRDI QIDQ1149433zbMATH OpenOpenAlexFDO

Authors Thomas H. Payne

Publication date 1980

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

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

zbMATH Keywords

composition closureindexingiteration closurenormal form theoremspairing functionstest function

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03D99) Proof theory and constructive mathematics (03F99)

Cited in

(1)

• A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points

This page was built for publication: General computability

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