Serikzhan A. Badaev

From MaRDI portal
Person:810012

Available identifiers

zbMath Open badaev.serikzhan-aMaRDI QIDQ810012

List of research outcomes





PublicationDate of PublicationType
On diagonal functions for equivalence relations2024-04-16Paper
Rogers semilattices with least and greatest elements in the Ershov hierarchy2023-01-04Paper
Special classes of positive preorders2022-06-17Paper
One-element Rogers semilattices in the Ershov hierarchy2022-01-13Paper
The structure of computably enumerable preorder relations2020-12-04Paper
ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS2020-04-17Paper
Some absolute properties of \(A\)-computable numberings2019-03-13Paper
A Survey on Universal Computably Enumerable Equivalence Relations2017-04-04Paper
Weakly precomplete computably enumerable equivalence relations2016-03-17Paper
Families without minimal numberings2015-05-11Paper
Generalized computable universal numberings2015-05-11Paper
Friedberg numberings in the Ershov hierarchy2015-02-23Paper
Rogers semilattices of families of two embedded sets in the Ershov hierarchy2012-09-12Paper
Inductive inference and computable numberings2011-04-05Paper
https://portal.mardi4nfdi.de/entity/Q30682782011-01-13Paper
A decomposition of the Rogers semilattice of a family of d.c.e. sets2009-06-04Paper
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy2008-12-18Paper
On a Question of Frank Stephan2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q53849662008-04-29Paper
https://portal.mardi4nfdi.de/entity/Q34344812007-05-02Paper
Theory and Applications of Models of Computation2007-04-30Paper
Elementary Theories for Rogers Semilattices2006-11-17Paper
A note on partial numberings2005-04-07Paper
https://portal.mardi4nfdi.de/entity/Q44608292004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q47955252003-02-24Paper
https://portal.mardi4nfdi.de/entity/Q45307302002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45139622001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45011452000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q42201901998-11-22Paper
https://portal.mardi4nfdi.de/entity/Q48751171996-12-01Paper
On minimal numerations1996-08-28Paper
Minimal numerations of positively computable families1995-06-26Paper
On cardinality of semilattices of enumerations of nondiscrete families1994-11-08Paper
A problem of S. S. Goncharov1992-09-26Paper
On weakly pre-complete positive equivalences1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33601711991-01-01Paper
Computable enumerations of families of general recursive functions1978-01-01Paper
Positive enumerations1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41336181977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41686031977-01-01Paper
On incomparable enumerations1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40779991974-01-01Paper

Research outcomes over time

This page was built for person: Serikzhan A. Badaev