@inproceedings{9076d6ce20504d2eb9e06d0ac8f682a7,
title = "Logics Which Capture Complexity Classes over the Reals",
abstract = "We study real number complexity classes under a logical point of view. Following the approaches by Blum, Shub, and Smale [3] for computability and by Gradel and Meer [10] for descriptive complexity theory over the reals, we characterize such complexity classes by purely logical means. Among them we mainly find parallel classes which have not been studied in [10].",
author = "Felipe Cucker and Klaus Meer",
year = "1997",
month = sep,
doi = "10.1007/BFb0036180",
language = "English",
isbn = "3540633863",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "157--167",
editor = "Chlebus, \{Bogdan S.\} and Ludwik Czaja",
booktitle = "Fundamentals of Computation Theory",
address = "Germany",
note = "11th International Symposium on Fundamentals of Computation Theory (FCT'97) ; Conference date: 01-09-1997 Through 03-09-1997",
}