scientific article; zbMATH DE number 2167508
From MaRDI portal
Publication:4677692
zbMATH Open1063.03028MaRDI QIDQ4677692FDOQ4677692
Authors: Steffen Lempp, S. S. Goncharov, Reed Solomon 
Publication date: 12 May 2005
Full work available at URL: https://eudml.org/doc/188006
Title of this publication is not available (Why is that?)
Recommendations
- Friedberg numberings of families of partial computable functionals
- scientific article; zbMATH DE number 7139148
- Computable numberings of families of infinite sets
- Almost computably enumerable families of sets
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- The number of nonequivalent computable indexations for a fixed family of sets
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
- scientific article; zbMATH DE number 4101161
- Friedberg splittings of recursively enumerable sets
- scientific article; zbMATH DE number 3995654
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (32)
- Friedberg numbering in fragments of Peano arithmetic and \(\alpha\)-recursion theory
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Almost computably enumerable families of sets
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- On universal pairs in the Ershov hierarchy
- Effectively closed sets and enumerations
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- Rogers semilattices of limitwise monotonic numberings
- Effectively infinite classes of numberings and computable families of reals
- Friedberg numberings of families of partial computable functionals
- Two theorems on minimal generalized computable numberings
- Positive presentations of families relative to \(e\)-oracles
- Numberings and randomness
- Theories of Rogers semilattices of analytical numberings
- Reductions between types of numberings
- Friedberg numberings in the Ershov hierarchy
- Friedberg numberings in the Ershov hierarchy
- The branching theorem and computable categoricity in the Ershov hierarchy
- The number of nonequivalent computable indexations for a fixed family of sets
- Computable numberings of families of infinite sets
- Title not available (Why is that?)
- Rogers semilattices of punctual numberings
- Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
- Properties of numberings in various levels of the Ershov hierarchy
- Rogers semilattices with least and greatest elements in the Ershov hierarchy
- Classifications of computable structures
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
- Classifications of definable subsets
- Computability theory. Abstracts from the workshop held January 7--13, 2018
- Positive presentations of families in relation to reducibility with respect to enumerability
- Enumerations of \(\Pi^0_1\) classes: acceptability and decidable classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677692)
