Predicatively computable functions on sets (Q2339966): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119608156 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.5582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAFE RECURSIVE SET FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fine structure of the constructible hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof-theoretic characterization of the primitive recursive set functions / rank
 
Normal rank

Latest revision as of 22:36, 9 July 2024

scientific article
Language Label Description Also known as
English
Predicatively computable functions on sets
scientific article

    Statements

    Identifiers