default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManat Mustafa
Person information
- affiliation: Nazarbayev University, Astana, Kazakhstan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa:
On diagonal functions for equivalence relations. Arch. Math. Log. 63(3-4): 259-278 (2024)- [c7]Nikolay Bazhenov
, Marta Fiori-Carones, Manat Mustafa:
On Arithmetical Numberings in Reverse Mathematics. CiE 2024: 126-138 - [c6]Nikolay Bazhenov, Manat Mustafa:
On Learning Families of Ideals in Lattices and Boolean Algebras. TAMC 2024: 1-13 - 2022
- [j9]Uri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber:
The first-order theory of the computably enumerable equivalence relations in the uncountable setting. J. Log. Comput. 32(1): 98-114 (2022) - [j8]Nikolay Bazhenov, Manat Mustafa, Zhansaya Tleuliyeva:
Rogers semilattices of limitwise monotonic numberings. Math. Log. Q. 68(2): 213-226 (2022) - [j7]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Rogers semilattices of punctual numberings. Math. Struct. Comput. Sci. 32(2): 164-188 (2022) - [j6]Nurlan Ismailov, Ivan Kaygorodov, Manat Mustafa:
The algebraic and geometric classification of nilpotent right alternative algebras. Period. Math. Hung. 84(1): 18-30 (2022) - [c5]Nikolay Bazhenov, Manat Mustafa, Anvar M. Nurakunov:
On Two Types of Concept Lattices in the Theory of Numberings. TAMC 2022: 79-92 - 2021
- [c4]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro:
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy. LORI 2021: 1-13 - 2020
- [j5]Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev:
Classifying equivalence relations in the Ershov hierarchy. Arch. Math. Log. 59(7-8): 835-864 (2020) - [c3]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Semilattices of Punctual Numberings. TAMC 2020: 1-12
2010 – 2019
- 2019
- [j4]Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev:
Elementary theories and hereditary undecidability for semilattices of numberings. Arch. Math. Log. 58(3-4): 485-500 (2019) - [j3]Ian Herbert, Sanjay Jain, Steffen Lempp, Manat Mustafa, Frank Stephan:
Reductions between types of numberings. Ann. Pure Appl. Log. 170(12) (2019) - [c2]Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Bounded Reducibility for Computable Numberings. CiE 2019: 96-107 - [c1]Nikolay Bazhenov, Manat Mustafa, Mars M. Yamaleev:
Computable Isomorphisms of Distributive Lattices. TAMC 2019: 28-41 - 2015
- [j2]Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi:
Friedberg numberings in the Ershov hierarchy. Arch. Math. Log. 54(1-2): 59-73 (2015) - 2012
- [j1]Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi:
Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Math. Log. Q. 58(4-5): 366-376 (2012)
Coauthor Index
aka: Nikolay A. Bazhenov
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
