The following pages link to Theorie der Numerierungen I (Q4047540):
Displaying 50 items.
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Two categories of effective continuous cpos (Q854182) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Towards the range property for the lambda theory \(\mathcal H\) (Q930864) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- Type 2 recursion theory (Q1073021) (← links)
- Theory of representations (Q1073022) (← links)
- Recursion theorems and effective domains (Q1102949) (← links)
- Partial morphisms in categories of effective objects (Q1109126) (← links)
- A small complete category (Q1112159) (← links)
- Computing with infinite objects (Q1158755) (← links)
- Total sets and objects in domain theory (Q1210138) (← links)
- Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator (Q1683372) (← links)
- Jumps of computably enumerable equivalence relations (Q1693042) (← links)
- Strong reducibility of partial numberings (Q1766927) (← links)
- Retracts of numerations (Q1823236) (← links)
- Discrete families of recursive functions and index sets (Q1842381) (← links)
- Effective inseparability in a topological setting (Q1923565) (← links)
- Precomplete numberings (Q2036469) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Type 2 computational complexity of functions on Cantor's space (Q2277260) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- Some independence results for control structures in complete numberings (Q2732286) (← links)
- Can partial indexings be totalized? (Q2758051) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
- Stability of representations of effective partial algebras (Q2996232) (← links)
- Classifying positive equivalence relations (Q3309827) (← links)
- Reducibility of domain representations and Cantor–Weihrauch domain representations (Q3545272) (← links)
- A decomposition of the Rogers semilattice of a family of d.c.e. sets (Q3630582) (← links)
- Universal recursion theoretic properties of r.e. preordered structures (Q3699683) (← links)
- A Real Number Structure that is Effectively Categorical (Q4243908) (← links)
- Computability of String Functions Over Algebraic Structures Armin Hemmerling (Q4379625) (← links)
- On effective topological spaces (Q4391431) (← links)
- Computable elements and functions in effectively enumerable topological spaces (Q4593240) (← links)
- GENERALIZATIONS OF THE RECURSION THEOREM (Q4647121) (← links)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras (Q4650302) (← links)
- A note on partial numberings (Q4666942) (← links)
- Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (Q4764617) (← links)
- Remarks on Uniformly Finitely Precomplete Positive Equivalences (Q4868242) (← links)
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
- Rogers semilattices of punctual numberings (Q5048010) (← links)
- Image of Soviet and Russian logic in the West. Latter Half of the XXth Century (Q5059702) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- Computable analysis with applications to dynamic systems (Q5220187) (← links)
- On the existence of universal numberings for finite families of d.c.e. sets (Q5419207) (← links)
