Cobham recursive set functions
DOI10.1016/J.APAL.2015.12.005zbMATH Open1383.03050OpenAlexW2252118216MaRDI QIDQ904151FDOQ904151
Authors: Arnold Beckmann, Sy-David Friedman, Moritz Müller, Neil Thapen, Samuel R. Buss 
Publication date: 12 January 2016
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2015.12.005
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Set theory (03E99)
Cites Work
- Title not available (Why is that?)
- The fine structure of the constructible hierarchy
- A new recursion-theoretic characterization of the polytime functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Predicatively computable functions on sets
- Safe recursive set functions
- Cobham recursive set functions
Cited In (9)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Feasible set functions have small circuits
- On computability and tractability for infinite sets
- Minimization and \(\mathbf{NP}\) multifunctions
- On efficiency of notations for natural numbers
- Cobham recursive set functions
- Safe recursive set functions
- Cobham recursive set functions and weak set theories
- Predicatively computable functions on sets
This page was built for publication: Cobham recursive set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904151)
