Partial Continuous Functions and Admissible Domain Representations

DOI10.1093/LOGCOM/EXM034zbMath1155.03029OpenAlexW2072270605MaRDI QIDQ5441121

Fredrik Dahlgren

Publication date: 7 February 2008

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/405bc4ab857f9fa72c0ce36af428f77620d94344

zbMATH Keywords

computability theorydomain theorycomputable analysisdomain representations

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Higher-type and set recursion theory (03D65)

Related Items (1)

Computable analysis with applications to dynamic systems

This page was built for publication: Partial Continuous Functions and Admissible Domain Representations