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