Algorithmic operators in constructive metric spaces

DOI10.1090/TRANS2/064/01MaRDI QIDQ5573970zbMATH OpenOpenAlexFDO

Authors G. S. Citin

Publication date 1967

Published in Nine Papers on Logic and Group Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/trans2/064/01

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(15)

• Total sets and objects in domain theory
• A domain-theoretic approach to computability on the real line
• Computable Banach spaces via domain theory
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• On the information carried by programs about the objects they compute
• Effective inseparability in a topological setting
• An abstract data type for real numbers
• Church's thesis without tears
• Some results related to the continuity problem
• On the continuity of effective multifunctions
• Bi-topological spaces and the continuity problem
• Algebraic types in PER models
• Representations versus numberings: On the relationship of two computability notions
• Remarks and problems about algorithmic descriptions of groups
• Effective bases and notions of effective second countability in computable analysis

This page was built for publication: Algorithmic operators in constructive metric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573970)