A. N. Degtev

From MaRDI portal
Person:178406

Available identifiers

zbMath Open degtev.a-nMaRDI QIDQ178406

List of research outcomes





PublicationDate of PublicationType
New series of weakly implicative selector sets2014-11-17Paper
\(\varepsilon\)-principal numberings2008-12-11Paper
https://portal.mardi4nfdi.de/entity/Q54912332006-10-10Paper
On \(p\)-reducibility of computable numerations2004-03-17Paper
Almost combinatorial selector sets2002-06-02Paper
On reducibility of partial recursive functions2001-06-10Paper
Weakly implicatively selective sets of dimension 32001-05-10Paper
Almost semirecursive sets2000-08-02Paper
https://portal.mardi4nfdi.de/entity/Q42422141999-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42230801998-12-13Paper
https://portal.mardi4nfdi.de/entity/Q42106191998-09-23Paper
On correlations between complete sets1996-05-12Paper
On multiple positive reducibility1996-01-15Paper
https://portal.mardi4nfdi.de/entity/Q43167101995-08-10Paper
Certain properties of deducibility operators1994-07-13Paper
On p-reducibility of numerations1993-11-28Paper
The semilattice of computable families of recursively enumerable sets1993-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39829141992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33489021990-01-01Paper
Recursive-combinatorial properties of subsets of the natural numbers1990-01-01Paper
Weak combinatorial selective properties of subsets of the natural numbers1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38243001989-01-01Paper
A problem of Odifreddi1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47311781988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37787371987-01-01Paper
Computable numberings to which noncomputable numberings are positively reducible1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47297731986-01-01Paper
Semilattices of disjunctive and linear degrees1985-01-01Paper
A category of enumerated sets1984-01-01Paper
Relations between table-type degrees1983-01-01Paper
Relations between reducibilities of table type1983-01-01Paper
Comparison of linear reducibility with other reducibilities of tabular type1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47405571982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39689191981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33203521981-01-01Paper
A category of partial recursive functions1981-01-01Paper
ON REDUCIBILITIES OF NUMERATIONS1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38954491980-01-01Paper
Several results on upper semilattices and m-degrees1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38906761980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41984941979-01-01Paper
Three theorems on tt-degrees1979-01-01Paper
Solvability of the all-existence-theory of a certain factor-lattice of recursively enumerable sets1979-01-01Paper
REDUCIBILITIES OF TABULAR TYPE IN THE THEORY OF ALGORITHMS1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39429471979-01-01Paper
A family of maximal subalgebras of R. Robinson's algebra1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41689141978-01-01Paper
m-degrees of supersets of simple sets1978-01-01Paper
Reducibility of partial recursive functions. II1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38536101978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38890371978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41548541977-01-01Paper
Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees1977-01-01Paper
Minimal 1-degrees and truth-table reducibility1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41354821977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41288051976-01-01Paper
Reducibility of partial recursive functions1976-01-01Paper
tt- and m-degrees1974-01-01Paper
Hereditary sets and tabular reducibility1973-01-01Paper
m-powers of simple sets1973-01-01Paper
Hypersimple sets with retraceable complements1972-01-01Paper
Remarks on retracable, regressive, and pointwise-decomposable sets1972-01-01Paper

Research outcomes over time

This page was built for person: A. N. Degtev