Chi Tat Chong

According to our database, Chi Tat Chong authored at least 31 papers between 1974 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$ -SETS.

Chi Tat Chong, Liuzhen Wu, Liang Yu

J. Symb. Log., 2019

2017

1-Generic Degrees Bounding Minimal Degrees Revisited.

C. T. Chong

Proceedings of the Computability and Complexity, 2017

2015

Randomness in the Higher Setting.

Chi Tat Chong, Liang Yu

J. Symb. Log., 2015

Partial functions and domination.

C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky

Log. Methods Comput. Sci., 2015

Recursion Theory - Computational Aspects of Definability.

Chi Tat Chong, Liang Yu

de Gruyter series in logic and its applications 8, de Gruyter Oldenbourg, ISBN: 978-3-11-027555-1, 2015

2014

Nonstandard Models in Recursion Theory and Reverse Mathematics.

C. T. Chong, Wei Li, Yue Yang

Bull. Symb. Log., 2014

2007

Maximal chains in the Turing degrees.

Chi Tat Chong, Liang Yu

J. Symb. Log., 2007

Thin Maximal Antichains in the Turing Degrees.

Chi Tat Chong, Liang Yu

Proceedings of the Computation and Logic in the Real World, 2007

2006

The existence of high nonbounding degrees in the difference hierarchy.

Chi Tat Chong, Angsheng Li, Yue Yang

Ann. Pure Appl. Log., 2006

2005

The minimal e-degree problem in fragments of Peano arithmetic.

Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang

Ann. Pure Appl. Log., 2005

1999

Ordinal Recursion Theory.

C. T. Chong, Sy D. Friedman

Proceedings of the Handbook of Computability Theory, 1999

1998

Sigma₂ Induction and Infinite Injury Priority Argument, Part I: Maximal Sets and the Jump Operator.

Chi Tat Chong, Yue Yang

J. Symb. Log., 1998

1997

Sigma₂ Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma₂ Coding and the Jump Operator.

Chi Tat Chong, Yue Yang

Ann. Pure Appl. Log., 1997

1996

Computer Science Education in the Asia-Pacific Region in the 21st Century.

C. T. Chong

Proceedings of the COMPSAC '96, 1996

1995

The polynomial topological complexity of Fatou-Julia sets.

C. T. Chong

Adv. Comput. Math., 1995

1994

Positive Reducibility of the Interior of Filled Julia Sets.

Chi Tat Chong

J. Complex., 1994

1990

The Degree of a Sigma_n Cut.

Chi Tat Chong, K. J. Mourad

Ann. Pure Appl. Log., 1990

Minimal Degrees Recursive in 1-Generic Degrees.

Chi Tat Chong, Rodney G. Downey

Ann. Pure Appl. Log., 1990

1989

Hyperhypersimple Sets and Delta₂ Systems.

Chi Tat Chong

Ann. Pure Appl. Log., 1989

1987

∑₁-Density and Turing Degrees.

C. T. Chong

Math. Log. Q., 1987

Degree-theoretic bounds on the morley rank.

C. T. Chong

Arch. Math. Log., 1987

1986

1-Generic degrees and minimal degrees in higher recursion theory, II.

C. T. Chong

Ann. Pure Appl. Log., 1986

1984

Minimal<i>α</i>-hyperdegrees.

C. T. Chong

Arch. Math. Log., 1984

1983

Meeting of the Association for Symbolic Logic: Singapore 1981.

Chi Tat Chong

J. Symb. Log., 1983

Hyperhypersimple Supersets in Admissible Recursion Theory.

Chi Tat Chong

J. Symb. Log., 1983

Degree theory on aleph_ω.

C. T. Chong, Sy D. Friedman

Ann. Pure Appl. Log., 1983

Global and local admissibility: II. Major subsets and automorphisms.

C. T. Chong

Ann. Pure Appl. Log., 1983

1982

Double Jumps of Minimal Degrees Over Cardinals.

Chi Tat Chong

J. Symb. Log., 1982

1976

Minimal Upper Bounds for Ascending Sequences of alpha-Recursively Enumerable Degrees.

Chi Tat Chong

J. Symb. Log., 1976

An alpha-Finite Injury Method of the Unbounded Type.

Chi Tat Chong

J. Symb. Log., 1976

1974

Almost Local Non-a-Recursiveness.

Chi Tat Chong

J. Symb. Log., 1974