Computability
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 4)
Handbook of logic in computer science (vol. 3)
Real number computability and domain theory
Information and Computation
A domain-theoretic approach to computability on the real line
Theoretical Computer Science - Special issue on real numbers and computers
Computable analysis: an introduction
Computable analysis: an introduction
Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
A Logical Approach to Specification of Hybrid Systems
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Characteristic Properties of Majorant-Computability over the Reals
Proceedings of the 12th International Workshop on Computer Science Logic
Complexity theory on real numbers and functions
Proceedings of the 6th GI-Conference on Theoretical Computer Science
The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Towards computability of higher type continuous data
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
We propose semantic characterisations of second-order computability over the reals based on Σ-definability theory. Notions of computability for operators and real-valued functionals defined on the class of continuous functions are introduced via domain theory. We consider the reals with and without equality and prove theorems which connect computable operators and real-valued functionals with validity of finite Σ-formulas.