default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHristo Ganchev
Person information
- affiliation: St. Clement of Ohrid University of Sofia, Bulgaria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Hristo Aleksndrov Ganchev, Iskander Sh. Kalimullin, Joseph S. Miller
, Mariya Ivanova Soskova:
A Structural Dichotomy in the Enumeration Degrees. J. Symb. Log. 87(2): 527-544 (2022)- 2021
- [j11]Hristo Ganchev, Andrey Sariev:
The automorphism group and definability of the jump operator in the ømega-enumeration degrees. Arch. Math. Log. 60(7): 909-925 (2021)
2010 – 2019
- 2019
- [j10]Hristo Ganchev, Andrey Sariev:
Definability in the local structure of the ω-Turing degrees. Math. Struct. Comput. Sci. 29(7): 927-937 (2019) - [c4]Nikolay Bazhenov, Hristo Ganchev, Stefan V. Vatev:
Effective Embeddings for Pairs of Structures. CiE 2019: 84-95 - 2018
- [j9]Hristo Aleksndrov Ganchev, Mariya Ivanova Soskova:
The jump hierarchy in the enumeration degrees. Comput. 7(2-3): 179-188 (2018) - 2017
- [p1]Hristo Ganchev, Dimiter Skordev:
Ivan Soskov: A Life in Computability. The Incomputable 2017: 11-46 - 2016
- [j8]Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent, Andrea Sorbi:
A note on the enumeration degrees of 1-generic sets. Arch. Math. Log. 55(3-4): 405-414 (2016) - [j7]Hristo Ganchev, Andrea Sorbi:
Initial Segments Of The Σ20 Enumeration Degrees. J. Symb. Log. 81(1): 316-325 (2016) - 2014
- [j6]Andrey Sariev, Hristo Ganchev:
The ω-Turing degrees. Ann. Pure Appl. Log. 165(9): 1512-1532 (2014) - [c3]Andrey Sariev, Vladislav Nenchev, Stefan Gerdjikov, Petar Mitankin, Hristo Ganchev, Stoyan Mihov, Tinko Tinchev:
Flexible Noisy Text Correction. Document Analysis Systems 2014: 31-35 - 2012
- [j5]Hristo Ganchev, Mariya Ivanova Soskova:
The high/low hierarchy in the local structure of the omega-enumeration degrees. Ann. Pure Appl. Log. 163(5): 547-566 (2012) - [j4]Hristo Ganchev, Mariya Ivanova Soskova:
Cupping and definability in the local structure of the enumeration degrees. J. Symb. Log. 77(1): 133-158 (2012) - [j3]Hristo Ganchev, Mariya Ivanova Soskova:
Interpreting true arithmetic in the local structure of the enumeration degrees. J. Symb. Log. 77(4): 1184-1194 (2012) - [j2]Hristo Ganchev, Mariya Ivanova Soskova:
Embedding distributive lattices in the Σ02 enumeration degrees. J. Log. Comput. 22(4): 779-792 (2012)
2000 – 2009
- 2009
- [j1]Hristo Ganchev, Ivan N. Soskov:
The jump operator on the omega-enumeration degrees. Ann. Pure Appl. Log. 160(3): 289-301 (2009) - [c2]Hristo Ganchev:
Definability in the Local Theory of the omega-Enumeration Degrees. CiE 2009: 242-249 - 2007
- [c1]Hristo Ganchev:
Exact Pair Theorem for the omega -Enumeration Degrees. CiE 2007: 316-324
Coauthor Index
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-10-07 22:06 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:
