On computational complexity in weakly admissible structures

DOI10.2307/2273195MaRDI QIDQ3874189zbMATH OpenOpenAlexFDO

Authors Viggo Stoltenberg-Hansen

Publication date 1980

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2273195

zbMATH Keywords

alpha-recursion theoryBlum's theoremcompression theoremweakly admissible structure

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Finite injury arguments in infinite computation theories
• On generalized computational complexity

This page was built for publication: On computational complexity in weakly admissible structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3874189)