Computable single-valued numerations

DOI10.1007/BF01669607MaRDI QIDQ1050980zbMATH OpenFDO

Authors S. S. Goncharov

Publication date 1981

Published in Algebra and Logic (Search for Journal in Brave)

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

zbMATH Keywords

computable family of recursive functionscomputable numerationsenumerable setsminimal numerations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites work

• A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
• Godel Numberings Versus Friedberg Numberings
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(24)

• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• The possible Turing degree of the nonzero member in a two element degree spectrum
• Degree spectra of relations on structures of finite computable dimension
• Some absolute properties of \(A\)-computable numberings
• On universal pairs in the Ershov hierarchy
• Turing degrees of complete formulas of almost prime models
• Reductions between types of numberings
• Effective categoricity for distributive lattices and Heyting algebras
• Enumerations in computable structure theory
• Degree spectra of intrinsically c. e. relations
• Degree Spectra of Relations on Computable Structures
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• European Summer Meeting of the Association for Symbolic Logic
• On the existence of universal numberings for finite families of d.c.e. sets
• Boolean algebras with distinguished endomorphisms and generating trees
• Friedberg numberings in the Ershov hierarchy
• Two theorems on minimal generalized computable numberings
• Numberings, c.e. oracles, and fixed points
• Extremal numberings and fixed point theorems
• A local version of the Slaman-Wehner theorem and families closed under finite differences
• A family with a single minimal but not least numbering
• On computable numberings of families of Turing degrees
• On the number of minimal elements of ideals of Rogers semilattices
• Some applications of computable one-one numberings

This page was built for publication: Computable single-valued numerations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050980)