Cobham recursive set functions

DOI10.1016/J.APAL.2015.12.005zbMath1383.03050OpenAlexW2252118216MaRDI QIDQ904151

Neil Thapen, Moritz Müller, Sy-David Friedman, Arnold Beckmann, 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

zbMATH Keywords

set functionpolynomial timeCobham recursionhereditarily finiterudimentary functionsmash function

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Set theory (03E99)

Related Items (3)

On efficiency of notations for natural numbers ⋮ Cobham recursive set functions ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017

Cites Work

• Cobham recursive set functions
• A new recursion-theoretic characterization of the polytime functions
• Predicatively computable functions on sets
• SAFE RECURSIVE SET FUNCTIONS
• The fine structure of the constructible hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cobham recursive set functions