Cobham recursive set functions and weak set theories

DOI10.1142/9789813223523_0005MaRDI QIDQ5137317zbMATH OpenOpenAlexFDO

Authors Arnold Beckmann, Moritz Müller, Neil Thapen, Samuel R. Buss, Sy-David Friedman

Publication date 2 December 2020

Published in Sets and Computations (Search for Journal in Brave)

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa30495

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65) Nonclassical and second-order set theories (03E70)

Recommendations

• Cobham recursive set functions
• A characterization of the \(\Sigma_1\)-definable functions of \(\text{KP}\omega+(\text{uniform AC})\)
• Feasible set functions have small circuits
• Safe recursive set functions
• A proof-theoretic characterization of the primitive recursive set functions

Cited in

(4)

• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• scientific article; zbMATH DE number 4128804 (Why is no real title available?)
• Feasible set functions have small circuits
• Cobham recursive set functions

This page was built for publication: Cobham recursive set functions and weak set theories

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