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