Can partial indexings be totalized?
From MaRDI portal
Publication:2758051
DOI10.2307/2695099zbMath0994.03035OpenAlexW2104260100MaRDI QIDQ2758051
Publication date: 2 October 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695099
Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain representability of metric spaces
- Total objects of domains
- A computational model for metric spaces
- Embedding metric spaces into CPO's
- Algebraic and fixed point equations over inverse limits of algebras
- Total sets and objects in domain theory
- Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality
- Computation on metric spaces via domain theory
- Interpreting higher computations as types with totality
- PCF extended with real numbers
- Total objects in inductively defined types
- Closing the gap between the continuous functionals and recursion in \(^3E\)
- Domain representations of topological spaces
- On some decision problems in programming
- Real number computability and domain theory
- Effective inseparability in a topological setting
- Theorie der Numerierungen I
- Theorie Der Numerierungen III
- Spaces of maximal points
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
This page was built for publication: Can partial indexings be totalized?