E-resources
Peer reviewed
-
Kh, Faĭzrahmanov M
Siberian advances in mathematics, 08/2023, Volume: 33, Issue: 3Journal Article
In the present article, we study universal, minimal, and complete numberings of families of arithmetic sets. We show that, for every and every nontrivial -computable family , there exists a -computable numbering that is not universal with respect to positive reducibilities and is complete with respect to each element . For finite families of computably enumerable sets, we obtain necessary and sufficient conditions for existence of numberings that are complete, computable, and not universal with respect to positive reducibilities. For every infinite -computable family and every element , we construct a -computable numbering that is complete with respect to and minimal with respect to classical and positive reducibilities.
Author
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.