Computable single-valued numerations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
- Godel Numberings Versus Friedberg Numberings
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Cited in
(23)- Enumerations in computable structure theory
- Some absolute properties of \(A\)-computable numberings
- On universal pairs in the Ershov hierarchy
- On computable numberings of families of Turing degrees
- A local version of the Slaman-Wehner theorem and families closed under finite differences
- Two theorems on minimal generalized computable numberings
- Effective categoricity for distributive lattices and Heyting algebras
- Extremal numberings and fixed point theorems
- Some applications of computable one-one numberings
- European Summer Meeting of the Association for Symbolic Logic
- Reductions between types of numberings
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- Numberings, c.e. oracles, and fixed points
- Degree Spectra of Relations on Computable Structures
- Friedberg numberings in the Ershov hierarchy
- Degree spectra of intrinsically c. e. relations
- Degree spectra of relations on structures of finite computable dimension
- A family with a single minimal but not least numbering
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- The possible Turing degree of the nonzero member in a two element degree spectrum
- On the existence of universal numberings for finite families of d.c.e. sets
- Boolean algebras with distinguished endomorphisms and generating trees
- Turing degrees of complete formulas of almost prime models
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)
