Finite injury arguments in infinite computation theories

DOI10.1016/0003-4843(79)90016-0zbMATH Open0417.03019OpenAlexW2069810006MaRDI QIDQ3206938FDOQ3206938

Authors: 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

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

Mathematics Subject Classification ID

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

Cited In (1)

• On computational complexity in weakly admissible structures

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

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