Infinite time computable model theory

Simple item page
dc.creatorHamkins, Joel David
dc.creatorMiller, Russell
dc.creatorSeabold, Daniel
dc.creatorWarner, Steve
dc.date2006-02-22
dc.date.accessioned2026-07-07T07:03:40Z
dc.date.available2026-07-07T07:03:40Z
dc.descriptionWe 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.
dc.description32 pages
dc.identifierhttps://arxiv.org/abs/math/0602483
dc.identifierhttp://arxiv.org/abs/math/0602483
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109063
dc.subjectLogic
dc.subject03D60; 03D45; 03C57; 03E15
dc.titleInfinite time computable model theory
dc.typetext

Files

Collections

arXiv