![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Mingzhong Cai
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber:
Limit computability and ultrafilters. Comput. 12(2): 101-115 (2023)
2010 – 2019
- 2016
- [j13]Mingzhong Cai, Steffen Lempp, Joseph S. Miller
, Mariya Ivanova Soskova:
On Kalimullin pairs. Comput. 5(2): 111-126 (2016) - [j12]Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin
, Steffen Lempp, Joseph S. Miller
, Antonio Montalbán:
The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. 81(3): 997-1006 (2016) - 2015
- [j11]George Barmpalias
, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman:
On the existence of a strong minimal pair. J. Math. Log. 15(1): 1550003:1-1550003:28 (2015) - [j10]Mingzhong Cai:
Unprovability and Proving Unprovability. Stud Logica 103(3): 559-578 (2015) - 2014
- [j9]Mingzhong Cai:
2-Minimality, jump classes and a note on natural definability. Ann. Pure Appl. Log. 165(2): 724-741 (2014) - [j8]Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller
:
Random strings and tt-degrees of Turing complete C.E. sets. Log. Methods Comput. Sci. 10(3) (2014) - 2013
- [j7]Mingzhong Cai, Richard A. Shore:
Low level nondefinability results: Domination and recursive enumeration. J. Symb. Log. 78(3): 1005-1024 (2013) - 2012
- [j6]Mingzhong Cai, Richard A. Shore, Theodore A. Slaman:
The n-R.E. Degrees: Undecidability and σ1 Substructures. J. Math. Log. 12(1): 1250005 (2012) - [j5]Mingzhong Cai:
Array nonrecursiveness and relative recursive enumerability. J. Symb. Log. 77(1): 21-32 (2012) - [j4]Mingzhong Cai, Richard A. Shore:
Domination, forcing, array nonrecursiveness and relative recursive enumerability. J. Symb. Log. 77(1): 33-48 (2012) - [j3]Mingzhong Cai:
Degrees of Relative Provability. Notre Dame J. Formal Log. 53(4): 479-489 (2012) - 2011
- [c1]Mingzhong Cai:
Three Theorems on n-REA Degrees: Proof-Readers and Verifiers. CiE 2011: 11-20 - 2010
- [j2]Mingzhong Cai:
A 2-Minimal non-Gl2 degree. J. Math. Log. 10(1-2) (2010) - [j1]Mingzhong Cai:
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree. Notre Dame J. Formal Log. 51(4): 443-455 (2010)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint