C. T. Chong

Follow

Generating author description...

All published works
Action Title Year Authors
+ On the strength of Ramsey's theorem for trees 2020 C. T. Chong
Wei Li
Wei Wang
Yue Yang
+ Where Pigeonhole Principles meet König Lemmas 2019 David Belanger
C. T. Chong
Wei Wang
Tin Lok Wong
Yue Yang
+ On The Computability of Perfect Subsets of Sets with Positive Measure 2018 C. T. Chong
Wei Li
Wei Wang
Yue Yang
+ Interpreting arithmetic in the r.e. degrees under Σ<sub>4</sub>-induction 2017 C. T. Chong
Richard A. Shore
Yue Yang
+ The inductive strength of Ramsey's Theorem for Pairs 2016 C. T. Chong
Theodore A. Slaman
Yue Yang
+ Measure-theoretic applications of higher Demuth’s Theorem 2015 C. T. Chong
Liang Yu
+ RANDOMNESS IN THE HIGHER SETTING 2015 C. T. Chong
Liang Yu
+ PDF Chat Partial functions and domination 2015 C. T. Chong
Gordon Hoi
Frank Stephan
Daniel Turetsky
+ Forcing, Iterated Ultrapowers, and Turing Degrees 2015 C. T. Chong
Q. Feng
Theodore A. Slaman
W. Hugh Woodin
Yue Yang
+ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS 2014 C. T. Chong
Wei Li
Yue Yang
+ PDF Chat The metamathematics of Stable Ramsey’s Theorem for Pairs 2014 C. T. Chong
Theodore A. Slaman
Yue Yang
+ <i>E</i>-Recursion, Forcing and C*-Algebras 2014 C. T. Chong
Q. Feng
Theodore A. Slaman
W. Hugh Woodin
Yue Yang
+ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>Π</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math>-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs 2012 C. T. Chong
Theodore A. Slaman
Yue Yang
+ Proceedings of the 11th Asian Logic Conference : in honor of Professor Chong Chitat on his 60th birthday, National University of Singapore, Singapore, 22-27 June 2009 2012 C. T. Chong
敏康 新井
+ Proceedings of the 10th Asian Logic Conference, Kobe, Japan, 1-6 September 2008 2010 敏康 新井
Jörg Brendle
宏孝 桔梗
C. T. Chong
Rodney G. Downey
寛晰 小野
+ PDF Chat The strength of the projective Martin conjecture 2009 C. T. Chong
Wei Wang
Liang Yu
+ Lowness of higher randomness notions 2008 C. T. Chong
André Nies
Liang Yu
+ NONSTANDARD METHODS IN RAMSEY'S THEOREM FOR PAIRS 2008 C. T. Chong
+ PDF Chat Computational Prospects of Infinity 2008 C. T. Chong
Feng Qi
Theodore A. Slaman
W. Hugh Woodin
Yue Yang
+ Computational Prospects of Infinity 2008 C. T. Chong
Feng Qi
Theodore A. Slaman
W. Hugh Woodin
Yue Yang
+ Computational prospects of infinity 2008 C. T. Chong
+ Maximal chains in the Turing degrees 2007 C. T. Chong
Liang Yu
+ The jump of a Σ<sub> <i>n</i> </sub> -cut 2007 C. T. Chong
Yue Yang
+ Higher Randomness Notions and Their Lowness Properties 2007 C. T. Chong
André Nies
Liwen Yu
+ The minimal e-degree problem in fragments of Peano arithmetic 2004 Marat Arslanov
C. T. Chong
S. Barry Cooper
Yanbing Yang
+ PDF Chat Ordinal Recursion Theory 1999 C. T. Chong
Sy D. Friedman
+ The polynomial topological complexity of Fatou-Julia sets 1995 C. T. Chong
+ Positive Reducibility of the Interior of Filled Julia Sets 1994 C. T. Chong
+ PDF Chat Σ_{𝑛} definable sets without Σ_{𝑛} induction 1992 C. T. Chong
K. J. Mourad
+ Minimal degrees recursive in 1-generic degrees 1990 C. T. Chong
Rodney G. Downey
+ Positive solutions to Post's problem 1990 C. T. Chong
K. J. Mourad
+ Hyperhypersimple sets and Δ2 systems 1989 C. T. Chong
+ PDF Chat Maximal sets and fragments of Peano arithmetic 1989 C. T. Chong
+ Degrees bounding minimal degrees 1989 C. T. Chong
Rodney G. Downey
+ Recursively enumerable sets in models of Σ2 collection 1989 C. T. Chong
+ $\Sigma_2$ Collection and Maximal Sets 1988 C. T. Chong
+ Degree-theoretic bounds on the morley rank 1987 C. T. Chong
+ PDF Chat 1-Generic degrees and minimal degrees in higher recursion theory 1987 C. T. Chong
+ ∑<sub>1</sub>‐Density and Turing Degrees 1987 C. T. Chong
+ 1-Generic degrees and minimal degrees in higher recursion theory, II 1986 C. T. Chong
+ Recursion theory on strongly Σ2 inadmissible ordinals 1985 C. T. Chong
+ Minimal degrees and 1-generic sets below 0′ 1984 C. T. Chong
Carl G. Jockusch
+ The jump operator and 1-generic sets 1984 C. T. Chong
+ Global and local admissibility: II. Major subsets and automorphisms 1983 C. T. Chong
+ Degree theory on ℵω 1983 C. T. Chong
Sy D. Friedman
+ Hyperhypersimple supersets in admissible recursion theory 1983 Chi Tat Chong
+ Degree theory on aleph ω . 1983 C. T. Chong
Sy D. Friedman
+ Double jumps of minimal degrees over cardinals 1982 C. T. Chong
+ Global and Local Admissibility 1982 C. T. Chong
+ Major subsets ofα-recursively enumerable sets 1979 C. T. Chong
+ PDF Chat Generic sets and minimal 𝛼-degrees 1979 C. T. Chong
+ Minimal upper bounds for ascending sequences of α-recursively enumerable degrees 1976 C. T. Chong
+ An α-finite injury method of the unbounded type 1976 C. T. Chong
+ An α-finite injury method of the unbounded type 1976 C. T. Chong
+ Minimal upper bounds for ascending sequences of α-recursively enumerable degrees 1976 C. T. Chong
+ Hyperhypersimple α-r.e. sets 1976 C. T. Chong
Manuel Lerman
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ <i>Σ<sub>2</sub></i>-collection and the infinite injury priority method 1988 Michael E. Mytilinaios
Theodore A. Slaman
9
+ Higher Recursion Theory 2017 Gerald E. Sacks
9
+ Degrees of Unsolvability. 1965 T. G. McLaughlin
Gerald E. Sacks
8
+ PDF Chat Splitting an $\alpha $-recursively enumerable set 1975 Richard A. Shore
7
+ Hyperhypersimple α-r.e. sets 1976 C. T. Chong
Manuel Lerman
7
+ PDF Chat On the jump of an 𝛼-recursively enumerable set 1976 Richard A. Shore
7
+ Subsystems of Second Order Arithmetic 1999 Stephen G. Simpson
6
+ <i>Σ<sub>2</sub></i>-collection and the infinite injury priority method 1988 Michael E. Mytilinaios
Theodore A. Slaman
6
+ Degrees of generic sets 1996 Masahiro Kumabe
6
+ PDF Chat On the Strength of Ramsey's Theorem 1995 David Seetapun
Theodore A. Slaman
6
+ PDF Chat On the strength of Ramsey's theorem for pairs 2001 Peter Cholak
Carl G. Jockusch
Theodore A. Slaman
6
+ Degrees of Unsolvability 1983 Manuel Lerman
5
+ PDF Chat Maximal 𝛼-r.e. sets 1974 Manuel Lerman
5
+ PDF Chat The metamathematics of Stable Ramsey’s Theorem for Pairs 2014 C. T. Chong
Theodore A. Slaman
Yue Yang
5
+ Reverse mathematics and Ramsey's property for trees 2010 Jared Corduan
Marcia J. Groszek
Joseph R. Mileti
4
+ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics 2009 C.P. Chong
Steffen Lempp
Yue Yang
4
+ PDF Chat RT<sub>2</sub><sup>2</sup> does not imply WKL<sub>0</sub> 2012 Jiayi Liu
4
+ On the Notion of Randomness 1970 Per Martin-Löf
4
+ Degrees joining to <b>0</b>′ 1981 David B. Posner
Robert W. Robinson
4
+ Ramsey's theorem and recursion theory 1972 Carl G. Jockusch
4
+ PDF Chat Recursively enumerable sets of positive integers and their decision problems 1944 Emil L. Post
4
+ Descriptive Set Theory 1980 Yiannis N. Moschovakis
4
+ PDF Chat Σ_{𝑛} definable sets without Σ_{𝑛} induction 1992 C. T. Chong
K. J. Mourad
3
+ Types of simple <i>α</i>-recursively enumerable sets 1976 Anne Leggett
Richard A. Shore
3
+ PDF Chat Randomness via effective descriptive set theory 2007 Greg Hjorth
André Nies
3
+ Minimal α-degrees 1972 Richard A. Shore
3
+ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>Π</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math>-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs 2012 C. T. Chong
Theodore A. Slaman
Yue Yang
3
+ Corrigendum to: “On the strength of Ramsey's Theorem for pairs” 2009 Peter Cholak
Carl G. Jockusch
Theodore A. Slaman
3
+ Major subsets ofα-recursively enumerable sets 1979 C. T. Chong
3
+ A recursively enumerable degree which will not split over all lesser ones 1976 A. H. Lachlan
3
+ Measure and category in effective descriptive set theory 1973 Alexander S. Kechris
3
+ A criterion for completeness of degrees of unsolvability 1957 R. Friedberg
3
+ Types of simple α-recursively enumerable sets 1976 Manuel Lerman
3
+ The Sacks density theorem and Σ<sub>2</sub>-bounding 1996 Marcia J. Groszek
Michael E. Mytilinaios
Theodore A. Slaman
3
+ The recursively enumerable α-degrees are dense 1976 Richard A. Shore
3
+ Σ2-induction and the construction of a high degree 1990 Marcia J. Groszek
Michael E. Mytilinaios
3
+ PDF Chat Some applications of the notions of forcing and generic sets 1964 Solomon Feferman
3
+ PDF Chat Completeness theorems, incompleteness theorems and models of arithmetic 1978 Kenneth McAloon
3
+ PDF Chat 𝛽-recursion theory 1979 Sy D. Friedman
3
+ Types of simple <i>α</i>-recursively enumerable sets 1976 Anne Leggett
Richard A. Shore
3
+ Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets 1974 Robert I. Soare
3
+ A Δ<sub>2</sub><sup>0</sup> set with no infinite low subset in either it or its complement 2001 Rod Downey
Denis R. Hirschfeldt
Steffen Lempp
Reed Solomon
2
+ PDF Chat Maximal sets and fragments of Peano arithmetic 1989 C. T. Chong
2
+ Incompleteness along paths in progressions of theories 1962 Solomon Feferman
Clifford Spector
2
+ Metamathematics of First-Order Arithmetic 1993 Petr Hájek
Pavel Pudlák
2
+ PDF Chat On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines 1989 Lenore Blum
M. Shub
Steve Smale
2
+ PDF Chat Reverse mathematics, computability, and partitions of trees 2009 Jennifer Chubb
Jeffry L. Hirst
Timothy H. McNicholl
2
+ The jump of a Σ<sub> <i>n</i> </sub> -cut 2007 C. T. Chong
Yue Yang
2
+ On minimal pairs and minimal degrees in higher recursion theory 1977 Wolfgang Maaß
2
+ Some Reasons for Generalizing Recursion Theory 1971 G. Kreisel
2