Theorie der Numerierungen I
DOI10.1002/MALQ.19730191901zbMATH Open0295.02025OpenAlexW2126544183MaRDI QIDQ4047540FDOQ4047540
Authors: Yuri L. Ershov 
Publication date: 1973
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19730191901
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99)
Cited In (58)
- Type 2 recursion theory
- Retracts of numerations
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Partial morphisms in categories of effective objects
- Computing with infinite objects
- Total sets and objects in domain theory
- Computable elements and functions in effectively enumerable topological spaces
- Strong reducibility of partial numberings
- Recursion theorems and effective domains
- Rogers semilattices of limitwise monotonic numberings
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Computable embeddability for algebraic structures
- Discrete families of recursive functions and index sets
- Two categories of effective continuous cpos
- Classifying positive equivalence relations
- Universal recursion theoretic properties of r.e. preordered structures
- Representations versus numberings: On the relationship of two computability notions
- On local non‐compactness in recursive mathematics
- Computable one-to-one enumerations of effective domains
- Weakly precomplete equivalence relations in the Ershov hierarchy
- Fine hierarchies and m-reducibilities in theoretical computer science
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- Reducibility of domain representations and Cantor–Weihrauch domain representations
- Partial combinatory algebra and generalized numberings
- Precomplete numberings
- Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator
- Fixed point theorems for precomplete numberings
- A category-theoretic characterization of functional completeness
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
- Effective inseparability in a topological setting
- Stability of representations of effective partial algebras
- Can partial indexings be totalized?
- Rogers semilattices of punctual numberings
- Fixpoints and relative precompleteness
- A small complete category
- A Real Number Structure that is Effectively Categorical
- A note on partial numberings
- A Survey on Universal Computably Enumerable Equivalence Relations
- Computable analysis with applications to dynamic systems
- On effective topological spaces
- GENERALIZATIONS OF THE RECURSION THEOREM
- Towards the range property for the lambda theory \(\mathcal H\)
- Jumps of computably enumerable equivalence relations
- Towards a descriptive set theory for domain-like structures
- On the existence of universal numberings for finite families of d.c.e. sets
- Some independence results for control structures in complete numberings
- Admissible representations of effective cpo's
- Theory of representations
- The theory of ceers computes true arithmetic
- Type 2 computational complexity of functions on Cantor's space
- A learning-theoretic characterization of classes of recursive functions
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- Embeddings between partial combinatory algebras
- Effectively infinite classes of numberings and computable families of reals
- How much partiality is needed for a theory of computability?
- Effectively infinite classes of numberings and fixed point theorems
- Image of Soviet and Russian logic in the West. Latter Half of the XXth Century
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)
