License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2012.577
URN: urn:nbn:de:0030-drops-34234
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3423/
Abu Zaid, Faried ;
Grädel, Erich ;
Kaiser, Lukasz
The Field of Reals is not omega-Automatic
Abstract
We investigate structural properties of omega-automatic presentations of infinite structures in order to sharpen our methods to determine whether a given structure is omega-automatic. We apply these methods to show that no field of characteristic 0 admits an injective omega-automatic presentation, and that uncountable fields with a definable linear order cannot be omega-automatic.
BibTeX - Entry
@InProceedings{abuzaid_et_al:LIPIcs:2012:3423,
author = {Faried Abu Zaid and Erich Gr{\"a}del and Lukasz Kaiser},
title = {{The Field of Reals is not omega-Automatic}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
pages = {577--588},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
year = {2012},
volume = {14},
editor = {Christoph D{\"u}rr and Thomas Wilke},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3423},
URN = {urn:nbn:de:0030-drops-34234},
doi = {10.4230/LIPIcs.STACS.2012.577},
annote = {Keywords: Logic, Algorithmic Model Theory, Automatic Structures}
}
Keywords: |
|
Logic, Algorithmic Model Theory, Automatic Structures |
Collection: |
|
29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) |
Issue Date: |
|
2012 |
Date of publication: |
|
24.02.2012 |