default search action
Chi Tat Chong
Person information
- affiliation: National University of Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j26]Chi Tat Chong, Liuzhen Wu, Liang Yu:
BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$ -SETS. J. Symb. Log. 84(1): 376-387 (2019) - 2017
- [c3]C. T. Chong:
1-Generic Degrees Bounding Minimal Degrees Revisited. Computability and Complexity 2017: 536-546 - 2015
- [b1]Chi Tat Chong, Liang Yu:
Recursion Theory - Computational Aspects of Definability. de Gruyter series in logic and its applications 8, de Gruyter Oldenbourg 2015, ISBN 978-3-11-027555-1, pp. I-XIII, 1-306 - [j25]C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky:
Partial functions and domination. Log. Methods Comput. Sci. 11(3) (2015) - [j24]Chi Tat Chong, Liang Yu:
Randomness in the Higher Setting. J. Symb. Log. 80(4): 1131-1148 (2015) - 2014
- [j23]C. T. Chong, Wei Li, Yue Yang:
Nonstandard Models in Recursion Theory and Reverse Mathematics. Bull. Symb. Log. 20(2): 170-200 (2014)
2000 – 2009
- 2007
- [j22]Chi Tat Chong, Liang Yu:
Maximal chains in the Turing degrees. J. Symb. Log. 72(4): 1219-1227 (2007) - [c2]Chi Tat Chong, Liang Yu:
Thin Maximal Antichains in the Turing Degrees. CiE 2007: 162-168 - 2006
- [j21]Chi Tat Chong, Angsheng Li, Yue Yang:
The existence of high nonbounding degrees in the difference hierarchy. Ann. Pure Appl. Log. 138(1-3): 31-51 (2006) - 2005
- [j20]Marat M. Arslanov
, Chi Tat Chong, S. Barry Cooper, Yue Yang:
The minimal e-degree problem in fragments of Peano arithmetic. Ann. Pure Appl. Log. 131(1-3): 159-175 (2005)
1990 – 1999
- 1999
- [p1]C. T. Chong, Sy D. Friedman:
Ordinal Recursion Theory. Handbook of Computability Theory 1999: 277-299 - 1998
- [j19]Chi Tat Chong, Yue Yang:
Sigma2 Induction and Infinite Injury Priority Argument, Part I: Maximal Sets and the Jump Operator. J. Symb. Log. 63(3): 797-814 (1998) - 1997
- [j18]Chi Tat Chong, Yue Yang:
Sigma2 Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma2 Coding and the Jump Operator. Ann. Pure Appl. Log. 87(2): 103-116 (1997) - 1996
- [c1]C. T. Chong:
Computer Science Education in the Asia-Pacific Region in the 21st Century. COMPSAC 1996: 531 - 1995
- [j17]C. T. Chong:
The polynomial topological complexity of Fatou-Julia sets. Adv. Comput. Math. 3(4): 369-374 (1995) - 1994
- [j16]Chi Tat Chong:
Positive Reducibility of the Interior of Filled Julia Sets. J. Complex. 10(4): 437-444 (1994) - 1990
- [j15]Chi Tat Chong, Rodney G. Downey:
Minimal Degrees Recursive in 1-Generic Degrees. Ann. Pure Appl. Log. 48(3): 215-225 (1990) - [j14]Chi Tat Chong, K. J. Mourad:
The Degree of a Sigman Cut. Ann. Pure Appl. Log. 48(3): 227-235 (1990)
1980 – 1989
- 1989
- [j13]Chi Tat Chong:
Hyperhypersimple Sets and Delta2 Systems. Ann. Pure Appl. Log. 44(1-2): 25-38 (1989) - 1987
- [j12]C. T. Chong:
Degree-theoretic bounds on the morley rank. Arch. Math. Log. 26(1): 137-145 (1987) - [j11]C. T. Chong:
∑1-Density and Turing Degrees. Math. Log. Q. 33(2): 141-145 (1987) - 1986
- [j10]C. T. Chong:
1-Generic degrees and minimal degrees in higher recursion theory, II. Ann. Pure Appl. Log. 31: 165-175 (1986) - 1984
- [j9]C. T. Chong:
Minimalα-hyperdegrees. Arch. Math. Log. 24(1): 63-71 (1984) - 1983
- [j8]C. T. Chong, Sy D. Friedman:
Degree theory on alephω. Ann. Pure Appl. Log. 24(1): 87-97 (1983) - [j7]C. T. Chong:
Global and local admissibility: II. Major subsets and automorphisms. Ann. Pure Appl. Log. 24(2): 99-111 (1983) - [j6]Chi Tat Chong:
Hyperhypersimple Supersets in Admissible Recursion Theory. J. Symb. Log. 48(1): 185-192 (1983) - [j5]Chi Tat Chong:
Meeting of the Association for Symbolic Logic: Singapore 1981. J. Symb. Log. 48(3): 893-897 (1983) - 1982
- [j4]Chi Tat Chong:
Double Jumps of Minimal Degrees Over Cardinals. J. Symb. Log. 47(2): 329-334 (1982)
1970 – 1979
- 1976
- [j3]Chi Tat Chong:
An alpha-Finite Injury Method of the Unbounded Type. J. Symb. Log. 41(1): 1-17 (1976) - [j2]Chi Tat Chong:
Minimal Upper Bounds for Ascending Sequences of alpha-Recursively Enumerable Degrees. J. Symb. Log. 41(1): 250-260 (1976) - 1974
- [j1]Chi Tat Chong:
Almost Local Non-a-Recursiveness. J. Symb. Log. 39(3): 552-562 (1974)
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-04-24 22:47 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: