О минимальных 1-степенях и табличной сводимости.
Sibirskij matematiceskij zurnal (1976)
- Volume: 17, Issue: 5, page 1014-1022
- ISSN: 0037-4466; 1573-9260/e
Access Full Article
top
How to cite
topДёгтев, А.Н.. "О минимальных 1-степенях и табличной сводимости.." Sibirskij matematiceskij zurnal 17.5 (1976): 1014-1022. <http://eudml.org/doc/61539>.
@article{Дёгтев1976,
author = {Дёгтев, А.Н.},
journal = {Sibirskij matematiceskij zurnal},
keywords = {Pseudocreative Set; Recursively Enumerable Turing Degree; Truth-Table Reducibility; Minimal Degree},
language = {rus},
number = {5},
pages = {1014-1022},
publisher = {Izd. AN SSSR},
title = {О минимальных 1-степенях и табличной сводимости.},
url = {http://eudml.org/doc/61539},
volume = {17},
year = {1976},
}
TY - JOUR
AU - Дёгтев, А.Н.
TI - О минимальных 1-степенях и табличной сводимости.
JO - Sibirskij matematiceskij zurnal
PY - 1976
PB - Izd. AN SSSR
VL - 17
IS - 5
SP - 1014
EP - 1022
LA - rus
KW - Pseudocreative Set; Recursively Enumerable Turing Degree; Truth-Table Reducibility; Minimal Degree
UR - http://eudml.org/doc/61539
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.