Almost Local Non-a-Recursiveness. - Chi Tat Chong (J. Symb. Log., 1974)

An alpha-Finite Injury Method of the Unbounded Type. - Chi Tat Chong (J. Symb. Log., 1976)

Minimal Upper Bounds for Ascending Sequences of alpha-Recursively Enumerable Degrees. - Chi Tat Chong (J. Symb. Log., 1976)

Double Jumps of Minimal Degrees Over Cardinals. - Chi Tat Chong (J. Symb. Log., 1982)

Global and local admissibility: II. Major subsets and automorphisms. - C. T. Chong (Ann. Pure Appl. Log., 1983)

Degree theory on alephω. - C. T. Chong; Sy D. Friedman (Ann. Pure Appl. Log., 1983)

Hyperhypersimple Supersets in Admissible Recursion Theory. - Chi Tat Chong (J. Symb. Log., 1983)

Meeting of the Association for Symbolic Logic: Singapore 1981. - Chi Tat Chong (J. Symb. Log., 1983)

Minimalα-hyperdegrees. - C. T. Chong (Arch. Math. Log., 1984)

1-Generic degrees and minimal degrees in higher recursion theory, II. - C. T. Chong (Ann. Pure Appl. Log., 1986)

Degree-theoretic bounds on the morley rank. - C. T. Chong (Arch. Math. Log., 1987)

∑1-Density and Turing Degrees. - C. T. Chong (Math. Log. Q., 1987)

Hyperhypersimple Sets and Delta2 Systems. - Chi Tat Chong (Ann. Pure Appl. Log., 1989)

Minimal Degrees Recursive in 1-Generic Degrees. - Chi Tat Chong; Rodney G. Downey (Ann. Pure Appl. Log., 1990)

The Degree of a Sigman Cut. - Chi Tat Chong; K. J. Mourad (Ann. Pure Appl. Log., 1990)

Positive Reducibility of the Interior of Filled Julia Sets. - Chi Tat Chong (J. Complex., 1994)

The polynomial topological complexity of Fatou-Julia sets. - C. T. Chong (Adv. Comput. Math., 1995)

Computer Science Education in the Asia-Pacific Region in the 21st Century. - C. T. Chong (COMPSAC, 1996)

Sigma2 Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma2 Coding and the Jump Operator. - Chi Tat Chong; Yue Yang 004 (Ann. Pure Appl. Log., 1997)

Sigma2 Induction and Infinite Injury Priority Argument, Part I: Maximal Sets and the Jump Operator. - Chi Tat Chong; Yue Yang 004 (J. Symb. Log., 1998)

Ordinal Recursion Theory. - C. T. Chong; Sy D. Friedman (Handbook of Computability Theory, 1999)

The minimal e-degree problem in fragments of Peano arithmetic. - Marat M. Arslanov; Chi Tat Chong; S. Barry Cooper; Yue Yang 004 (Ann. Pure Appl. Log., 2005)

The existence of high nonbounding degrees in the difference hierarchy. - Chi Tat Chong; Angsheng Li; Yue Yang 004 (Ann. Pure Appl. Log., 2006)

Thin Maximal Antichains in the Turing Degrees. - Chi Tat Chong; Liang Yu 004 (CiE, 2007)

Maximal chains in the Turing degrees. - Chi Tat Chong; Liang Yu 004 (J. Symb. Log., 2007)

Nonstandard Models in Recursion Theory and Reverse Mathematics. - C. T. Chong; Wei Li 050; Yue Yang 004 (Bull. Symb. Log., 2014)

Recursion Theory - Computational Aspects of Definability. - Chi Tat Chong; Liang Yu 004 (de Gruyter Oldenbourg, 2015)

Partial functions and domination. - C. T. Chong; Gordon Hoi; Frank Stephan 001; Daniel Turetsky (Log. Methods Comput. Sci., 2015)

Randomness in the Higher Setting. - Chi Tat Chong; Liang Yu 004 (J. Symb. Log., 2015)

1-Generic Degrees Bounding Minimal Degrees Revisited. - C. T. Chong (Computability and Complexity, 2017)

BASIS THEOREMS FOR ${ rm{ Sigma }}_2^1$ -SETS. - Chi Tat Chong; Liuzhen Wu; Liang Yu 004 (J. Symb. Log., 2019)