Infinite time computable model theory

MaRDI QIDQ5384986zbMATH OpenFDO

Authors Joel David Hamkins, Daniel Evan Seabold, Steve Warner, Russell Miller

Publication date 29 April 2008

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

zbMATH Keywords

completeness theoreminfinite time Turing machines

Mathematics Subject Classification ID

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

Recommendations

• A Survey of Infinite Time Turing Machines
• Infinite time Turing machines
• Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
• Infinite computations with random oracles
• Logical Approaches to Computational Barriers

Cited in

(8)

• Infinite time extensions of Kleene's \({\mathcal O}\)
• Infinite computations with random oracles
• The Complexity of Infinite Computations In Models of Set Theory
• scientific article; zbMATH DE number 1531927 (Why is no real title available?)
• The classification of countable models of set theory
• Infinite time decidable equivalence relation theory
• Computable embeddings and strongly minimal theories
• Complexity profiles and generic Muchnik reducibility

This page was built for publication: Infinite time computable model theory

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