Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99)
Cited in
(60)- Admissible representations of effective cpo's
- Type 2 recursion theory
- Theory of representations
- Recursion theorems and effective domains
- Partial morphisms in categories of effective objects
- A small complete category
- Computing with infinite objects
- Total sets and objects in domain theory
- Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator
- Jumps of computably enumerable equivalence relations
- Strong reducibility of partial numberings
- Retracts of numerations
- Discrete families of recursive functions and index sets
- Effective inseparability in a topological setting
- Precomplete numberings
- Partial combinatory algebra and generalized numberings
- The theory of ceers computes true arithmetic
- Type 2 computational complexity of functions on Cantor's space
- Weakly precomplete equivalence relations in the Ershov hierarchy
- Fixed point theorems for precomplete numberings
- Some independence results for control structures in complete numberings
- Can partial indexings be totalized?
- A survey on universal computably enumerable equivalence relations
- Stability of representations of effective partial algebras
- Classifying positive equivalence relations
- Reducibility of domain representations and Cantor–Weihrauch domain representations
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Universal recursion theoretic properties of r.e. preordered structures
- A Real Number Structure that is Effectively Categorical
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- On effective topological spaces
- Computable elements and functions in effectively enumerable topological spaces
- GENERALIZATIONS OF THE RECURSION THEOREM
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- A note on partial numberings
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- Computability in partial combinatory algebras
- Rogers semilattices of punctual numberings
- Image of Soviet and Russian logic in the West. Latter Half of the XXth Century
- Fixpoints and relative precompleteness
- Computable analysis with applications to dynamic systems
- On the existence of universal numberings for finite families of d.c.e. sets
- On local non‐compactness in recursive mathematics
- Computable one-to-one enumerations of effective domains
- Computable embeddability for algebraic structures
- Representations versus numberings: On the relationship of two computability notions
- Rogers semilattices of limitwise monotonic numberings
- Effectively infinite classes of numberings and computable families of reals
- How much partiality is needed for a theory of computability?
- Embeddings between partial combinatory algebras
- Effectively infinite classes of numberings and fixed point theorems
- A learning-theoretic characterization of classes of recursive functions
- Computable structure theory of partial combinatory algebras
- Relative completeness of arithmetical numberings
- Two categories of effective continuous cpos
- Towards a descriptive set theory for domain-like structures
- A category-theoretic characterization of functional completeness
- Towards the range property for the lambda theory \(\mathcal H\)
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication: Theorie der Numerierungen I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047540)
