scientific article; zbMATH DE number 5269072

zbMath1149.03024arXivmath/0602483MaRDI QIDQ5384986

Steve Warner, Daniel Evan Seabold, Joel David Hamkins, Russell G. Miller

Publication date: 29 April 2008

Full work available at URL: https://arxiv.org/abs/math/0602483

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

completeness theoreminfinite time Turing machines

Mathematics Subject Classification ID

Consistency and independence results (03E35) Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (2)

Complexity profiles and generic Muchnik reducibility ⋮ The classification of countable models of set theory

This page was built for publication: