C. T. Chong

12 papers B 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2017 — conf
1-Generic Degrees Bounding Minimal Degrees Revisited.
Computability and Complexity
C. T. Chong
2015 J jnl
Partial functions and domination.
Log. Methods Comput. Sci.
C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky
2014 J jnl
Nonstandard Models in Recursion Theory and Reverse Mathematics.
Bull. Symb. Log.
C. T. Chong, Wei Li, Yue Yang
1999 — ch.
Ordinal Recursion Theory.
Handbook of Computability Theory
C. T. Chong, Sy D. Friedman
1996 B conf
Computer Science Education in the Asia-Pacific Region in the 21st Century.
COMPSAC
C. T. Chong
1995 J jnl
The polynomial topological complexity of Fatou-Julia sets.
Adv. Comput. Math.
C. T. Chong
1987 J jnl
Degree-theoretic bounds on the morley rank.
Arch. Math. Log.
C. T. Chong
1987 J jnl
∑
Math. Log. Q.
C. T. Chong
1986 J jnl
1-Generic degrees and minimal degrees in higher recursion theory, II.
Ann. Pure Appl. Log.
C. T. Chong
1984 J jnl
Minimal
Arch. Math. Log.
C. T. Chong
1983 J jnl
Degree theory on aleph
Ann. Pure Appl. Log.
C. T. Chong, Sy D. Friedman
1983 J jnl
Global and local admissibility: II. Major subsets and automorphisms.
Ann. Pure Appl. Log.
C. T. Chong