Infinite time computable model theory
Logic
2007-05-23 v1
Abstract
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 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.
Keywords
Cite
@article{arxiv.math/0602483,
title = {Infinite time computable model theory},
author = {Joel David Hamkins and Russell Miller and Daniel Seabold and Steve Warner},
journal= {arXiv preprint arXiv:math/0602483},
year = {2007}
}
Comments
32 pages