Computable single-valued numerations
From MaRDI portal
Publication:1050980
DOI10.1007/BF01669607zbMath0514.03029MaRDI QIDQ1050980
Publication date: 1981
Published in: Algebra and Logic (Search for Journal in Brave)
Related Items (22)
Degree spectra of relations on structures of finite computable dimension ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ 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 universal pairs in the Ershov hierarchy ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Some effects of Ash-Nerode and other decidability conditions on degree spectra ⋮ Degree spectra of intrinsically c.e. relations ⋮ A computably categorical structure whose expansion by a constant has infinite computable dimension ⋮ On the existence of universal numberings for finite families of d.c.e. sets ⋮ The possible Turing degree of the nonzero member in a two element degree spectrum ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Turing degrees of complete formulas of almost prime models ⋮ Some applications of computable one-one numberings ⋮ Reductions between types of numberings ⋮ Enumerations in computable structure theory ⋮ Degree Spectra of Relations on Computable Structures
Cites Work
This page was built for publication: Computable single-valued numerations
