Provable (and unprovable) computability

DOI10.1142/9789813270947_0007MaRDI QIDQ6600651zbMATH OpenFDO

Authors Stanley S. Wainer

Publication date 9 September 2024

Full work available at URL https://doi.org/10.1142/9789813270947_0007

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Functionals in proof theory (03F10) Second- and higher-order arithmetic and fragments (03F35)

This page was built for publication: Provable (and unprovable) computability

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