scientific article; zbMATH DE number 3664931
From MaRDI portal
Publication:3863873
Cited in
(28)- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- Total sets and objects in domain theory
- Some effectively infinite classes of enumerations
- \({\mathcal M}^\omega\) considered as a programming language
- Recursive unary algebras and trees
- Representability of locally compact regular spaces by domains and formal spaces
- Domain representations of topological spaces
- Equilogical spaces
- On recursively enumerable structures
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Inductive inference and computable numberings
- Enumerations in computable structure theory
- Rice's theorem in effectively enumerable topological spaces
- Computable elements and functions in effectively enumerable topological spaces
- Some results related to the continuity problem
- Nonflatness and totality
- Towards computability over effectively enumerable topological spaces
- Logic for exact real arithmetic
- Bi-topological spaces and the continuity problem
- scientific article; zbMATH DE number 7269245 (Why is no real title available?)
- Computability in higher types, P and the completeness of type assignment
- Computable one-to-one enumerations of effective domains
- A learning-theoretic characterization of classes of recursive functions
- On p-reducibility of numerations
- Domains, information frames, rough sets: an equivalence of categories
- A category-theoretic characterization of functional completeness
- Computability and the morphological complexity of some dynamics on continuous domains
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863873)
