On computational complexity in weakly admissible structures
From MaRDI portal
Publication:3874189
DOI10.2307/2273195zbMath0435.03031OpenAlexW2112854617MaRDI QIDQ3874189
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
Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cites Work
This page was built for publication: On computational complexity in weakly admissible structures