Some results related to the continuity problem

DOI10.1017/S0960129516000190zbMath1456.03063arXiv1602.04125MaRDI QIDQ4593245

Dieter Spreen

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04125

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domain representability of metric spaces
• The theory of A-spaces
• Computability concepts for programming language semantics
• Computable functionals of finite types
• On some decision problems in programming
• Effective inseparability in a topological setting
• Can partial indexings be totalized?
• Effective operations on partial recursive functions
• Effectivity and effective continuity of multifunctions
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• On effective topological spaces
• Continuous Lattices and Domains
• Computability theory in admissible domains
• Algorithmic operators in constructive metric spaces
• Recursive metric spaces
• Nicht konstruktiv beweisbare Sätze der Analysis
• Corrigendum
• Representations versus numberings: On the relationship of two computability notions

This page was built for publication: Some results related to the continuity problem