Some applications of computable one-one numberings

DOI10.1007/BF01792984zbMath0714.03038OpenAlexW2076678106MaRDI QIDQ750430

D. Kharzeev

Publication date: 1990

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01792984

zbMATH Keywords

Turing degreescomputable CPOcomputable one-one numberingsgeneralized computabilityisomorphism classes of recursive functions

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Numberings, c.e. oracles, and fixed points ⋮ Friedberg numberings in the Ershov hierarchy ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable one-to-one enumerations of effective domains
• An easy priority-free proof of a theorem of Friedberg
• Computable single-valued numerations
• Nonuniform autostability of models
• Problem of the number of non-self-equivalent constructivizations
• Über die Reduzierbarkeit berechenbarer Numerierungen
• Enumerations of families of general recursive functions
• Algorithmic degree of unars
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Theorie Der Numerierungen III
• A note on direct sums of Friedbergnumberings
• Godel Numberings Versus Friedberg Numberings
• Abstract First Order Computability. I
• Abstract Computability and Invariant Definability

This page was built for publication: Some applications of computable one-one numberings