Finite injury arguments in infinite computation theories

DOI10.1016/0003-4843(79)90016-0zbMath0417.03019OpenAlexW2069810006MaRDI QIDQ3206938

Viggo Stoltenberg-Hansen

Publication date: 1979

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(79)90016-0

zbMATH Keywords

recursion theory on admissible ordinalsaxiomatic recursion theoryexistence of a computable prewellorderingexistence of a recursive well-orderingfinite injury argumentsFriedberg theoriesinfinite computation theoriesPost's problem on resolvable admissible setsrecursion theory on arbitrary domainsSacks' splitting theorem

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (1)

On computational complexity in weakly admissible structures

This page was built for publication: Finite injury arguments in infinite computation theories