scientific article; zbMATH DE number 3536064
From MaRDI portal
Publication:4111546
zbMath0344.02031MaRDI QIDQ4111546
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (20)
Rogers semilattices of punctual numberings ⋮ Partial combinatory algebra and generalized numberings ⋮ Two categories of effective continuous cpos ⋮ Towards a descriptive set theory for domain-like structures ⋮ Partial morphisms in categories of effective objects ⋮ Fixpoints and relative precompleteness ⋮ Effective inseparability in a topological setting ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ How much partiality is needed for a theory of computability? ⋮ The Cuntz semigroup and domain theory ⋮ A category-theoretic characterization of functional completeness ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Total sets and objects in domain theory ⋮ R.e. Prime powers and total rigidity ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Precomplete numberings ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Computable analysis with applications to dynamic systems ⋮ Fixed point theorems for precomplete numberings ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
This page was built for publication:
