Recommendations
Cites work
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 1163985 (Why is no real title available?)
- scientific article; zbMATH DE number 3999883 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- A new recursion-theoretic characterization of the polytime functions
- Cobham recursive set functions
- Predicatively computable functions on sets
- Safe recursive set functions
- The fine structure of the constructible hierarchy
Cited in
(9)- Cobham recursive set functions and weak set theories
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- On efficiency of notations for natural numbers
- On computability and tractability for infinite sets
- Minimization and \(\mathbf{NP}\) multifunctions
- Cobham recursive set functions
- Safe recursive set functions
- Predicatively computable functions on sets
- Feasible set functions have small circuits
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)