Ordinal machines and admissible recursion theory

DOI10.1016/j.apal.2009.01.005zbMath1178.03061OpenAlexW2064937274MaRDI QIDQ1032634

Peter Koepke, Benjamin Seyfferth

Publication date: 26 October 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.01.005

zbMATH Keywords

computability theory\(\alpha \)-recursion theoryadmissible recursion theoryordinal machinesSacks-Simpson theorem

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

A representation of recursively enumerable sets through Horn formulas in higher recursion theory ⋮ Discrete Transfinite Computation ⋮ Symmetry for transfinite computability ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ Realisability for infinitary intuitionistic set theory ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Transfinite recursion and computation in the iterative conception of set ⋮ Ordinal Computability ⋮ Koepke machines and satisfiability for infinitary propositional languages ⋮ Towards computable analysis on the generalised real line ⋮ The basic theory of infinite time register machines ⋮ Characterizations of ITBM-computability. I ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Taming Koepke's zoo. II: Register machines ⋮ Post's problem for ordinal register machines: an explicit approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recursive functions of ordinal numbers
• Some More Minimal Pairs of α‐Recursively Enumerable Degrees
• The theory of transfinite recursion
• Turing Computations On Ordinals
• Metarecursive sets
• Metarecursively enumerable sets and their metadegrees
• The fine structure of the constructible hierarchy
• The α-finite injury method