General computability

From MaRDI portal

Publication:1149433

Jump to:navigation, search

DOI10.1305/NDJFL/1093883047zbMath0454.03024OpenAlexW4252994300MaRDI QIDQ1149433

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

indexing test function normal form theorems pairing functions composition closure iteration closure

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: General computability

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1149433&oldid=13210913"