# Infinite time computable model theory

• J. D. Hamkins, R. Miller, D. Seabold, and S. Warner, “Infinite time computable model theory,” in New Computational Paradigms: Changing Conceptions of What is Computable, S. B. Cooper, B. Löwe, and A. Sorbi, Eds., Springer, 2008, p. 521–557.
[Bibtex]
@INCOLLECTION{HamkinsMillerSeaboldWarner2007:InfiniteTimeComputableModelTheory,
AUTHOR = {Hamkins, Joel David and Miller, Russell and Seabold, Daniel
and Warner, Steve},
TITLE = {Infinite time computable model theory},
BOOKTITLE = "{New Computational Paradigms: Changing Conceptions of What is Computable}",
PAGES = {521--557},
PUBLISHER = {Springer},
}
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines,  which provide infinitary notions of computability for structures built on the reals  $\mathbb{R}$. Much of the finite time theory generalizes to the infinite time context, but several fundamental questions, including the infinite time  computable analogue of the Completeness Theorem, turn out to be  independent of ZFC.