Some results on $\mathbb{R}$-computable structures
Databases
2009-06-09 v2 Logic in Computer Science
Logic
Abstract
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction technique, effective categoricity, effective topology, and relations with other models for the effective theory of uncountable structures.
Cite
@article{arxiv.0803.3404,
title = {Some results on $\mathbb{R}$-computable structures},
author = {Wesley Calvert and John E. Porter},
journal= {arXiv preprint arXiv:0803.3404},
year = {2009}
}