Predicatively computable functions on sets

DOI10.1007/s00153-015-0422-2zbMath1371.03094arXiv1204.5582OpenAlexW2119608156MaRDI QIDQ2339966

Toshiyasu Arai

Publication date: 14 April 2015

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5582

zbMATH Keywords

set functionsdefinable functionspredicative computations

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)

Related Items (2)

SAFE RECURSIVE SET FUNCTIONS ⋮ Cobham recursive set functions

Cites Work

• Unnamed Item
• A new recursion-theoretic characterization of the polytime functions
• SAFE RECURSIVE SET FUNCTIONS
• A proof-theoretic characterization of the primitive recursive set functions
• The fine structure of the constructible hierarchy
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Predicatively computable functions on sets