Infinite time computable model theory

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
32 pages

Keywords

Logic, 03D60; 03D45; 03C57; 03E15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/109063

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0602483
 http://arxiv.org/abs/math/0602483

Collections

arXiv