Chong Chi Tat

Q: What Schools Are Affiliated With Chong Chi Tat

Chong Chi Tat is affiliated with the following schools: Yale University, Iowa State University, National University of Singapore

Chong Chi Tat's AcademicInfluence.com Rankings

Chong Chi Tat

Mathematics

#6507

World Rank

#8992

Historical Rank

Measure Theory

#4582

World Rank

#5362

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Chong Chi Tat Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Chong Chi Tat is university professor and director of the Institute for Mathematical Sciences at the National University of Singapore . His research interests are in the areas of recursion/computability theory.

(See a Problem?)

Chong Chi Tat's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

THE METAMATHEMATICS OF STABLE RAMSEY'S THEOREM FOR PAIRS (2014) (69)
ON THE ROLE OF THE COLLECTION PRINCIPLE FOR Σ2-FORMULAS IN SECOND-ORDER REVERSE MATHEMATICS (2009) (50)
Set-theoretic methods (1984) (49)
On the role of the collection principle for Sigma^0_2-formulas in second-order reverse mathematics (2010) (37)
Π11-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs (2012) (32)
Techniques of Admissible Recursion Theory (1985) (22)
Lowness of higher randomness notions (2008) (21)
Minimal Degrees Recursive in 1-Generic Degrees (1990) (20)
The inductive strength of Ramsey's Theorem for Pairs (2017) (20)
Fields Medallists' Lectures (1997) (17)
7 Classification of jump operators (2015) (17)
Computational prospects of infinity Part II, Presented talks / (2008) (16)
Hyperhypersimple α-r.e. sets (1976) (16)
RANDOMNESS IN THE HIGHER SETTING (2015) (15)
Recursion Theory - Computational Aspects of Definability (2015) (15)
Minimal degrees and 1-generic sets below 0′ (1984) (12)
Degrees bounding minimal degrees (1989) (12)
∑ n Definable Sets without ∑ n Induction (1992) (12)
Nonstandard Models in Recursion Theory and Reverse Mathematics (2014) (12)
Generic sets and minimal -degrees (1979) (10)
Σ_{} definable sets without Σ_{} induction (1992) (10)
Sigma2 Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma2 Coding and the Jump Operator (1997) (9)
Σ2 Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator (1998) (9)
The jump of a Σn‐cut (2007) (9)
The Degree of a Sigman Cut (1990) (8)
On the strength of Ramsey's theorem for trees (2020) (8)
On the computability of perfect subsets of sets with positive measure (2018) (8)
Recursion Theory on Weak Fragments of Peano Arithmetic: A Study of Definable Cuts (1998) (8)
Maximal chains in the Turing degrees (2007) (7)
E-recursion, forcing and C*-algebras (2014) (7)
Computational prospects of infinity Part I, Tutorials / (2008) (6)
Computational prospects of infinity (2008) (6)
A Recursion‐Theoretic Characterization of Constructible Reals (1977) (6)
∑2 Induction and infinite injury priority arguments, part III: Prompt sets, minimal pairs and Shoenfield’s Conjecture (2001) (5)
Recursively enumerable sets in models of Σ2 collection (1989) (5)
The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (2019) (5)
An α-finite injury method of the unbounded type (1976) (5)
Maximal sets and fragments of Peano arithmetic (1989) (5)
Forcing, Iterated Ultrapowers, and Turing Degrees (2015) (4)
The strength of the projective Martin conjecture (2010) (4)
Major subsets ofα-recursively enumerable sets (1979) (3)
A Π 11 -UNIFORMIZATION PRINCIPLE FOR REALS (2007) (3)
Infinity and truth (2014) (3)
Degree theory on alephω (1983) (2)
A Pi ^1_1-uniformization principle for reals (2009) (2)
Positive Reducibility of the Interior of Filled Julia Sets (1994) (2)
Hyperhypersimple Sets and Delta2 Systems (1989) (2)
INTERPRETING ARITHMETIC IN THE R.E. DEGREES UNDER Σ4-INDUCTION (2000) (2)
The existence of high nonbounding degrees in the difference hierarchy (2006) (2)
Higher Randomness Notions and Their Lowness Properties (2007) (2)
NONSTANDARD METHODS IN RAMSEY’S THEOREM FOR PAIRS (2006) (2)
Thin Maximal Antichains in the Turing Degrees (2007) (2)
∑1-Density and Turing Degrees (1987) (2)
Where pigeonhole principles meet Koenig lemmas (2019) (2)
Almost local non-α-recursiveness (1974) (1)
Proceedings of the 10th Asian Logic Conference, Kobe, Japan, 1-6 September 2008 (2010) (1)
The polynomial topological complexity of Fatou-Julia sets (1995) (1)
HYPERIMMUNE-FREE DEGREES BEYOND ω (2008) (1)
Minimal upper bounds for ascending sequences of α-recursively enumerable degrees (1976) (1)
1-Generic degrees and minimal degrees in higher recursion theory, II (1986) (1)
Ordinal Recursion Theory (1996) (1)
Partial functions and domination (2015) (1)
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) (1)
Global and Local Admissibility (1982) (1)
Global and local admissibility: II. Major subsets and automorphisms (1983) (1)
The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts (2016) (0)
Chapter 10: Applications to the S-space Problem and the von Neumann Problem (2014) (0)
Double jumps of minimal degrees over cardinals (1982) (0)
Chapter 2: Coding Sets by the Real Numbers (2014) (0)
11 Basis theorems (2015) (0)
Degree-theoretic bounds on the morley rank (1987) (0)
Chapter 13: Ramsey Theory on Ordinals (2014) (0)
The Fifth Asian Logic Conference, Singapore, 1993 (1994) (0)
2 Hyperarithmetic theory (2015) (0)
The α-finite injury method (1984) (0)
1-Generic degrees and minimal degrees in higher recursion theory (1987) (0)
Meeting of the Association for Symbolic Logic, Singapore, 1981 (1983) (0)
14 The theory of higher randomness (2015) (0)
Positive solutions to Post's problem (1990) (0)
13 More on hyperarithmetic theory (2015) (0)
A Open problems (2015) (0)
5 Recursion-theoretic forcing (2015) (0)
$\Sigma_2$ Collection and Maximal Sets (1988) (0)
Chapter 8: Ideal Dichotomies (2014) (0)
Measure-theoretic applications of higher Demuth’s Theorem (2016) (0)
Chapter 15: Five Linear Orderings (2014) (0)
Recursion theory on strongly Σ2 inadmissible ordinals (1985) (0)
6 Set theory (2015) (0)
Proceedings of the Sixth Asian Logic Conference, Beijing, China, 20-24 May 1996 (1998) (0)
Hyperhypersimple supersets in admissible recursion theory (1983) (0)
Chapter 9: Coherent and Lipschitz Trees (2014) (0)
The jump operator and 1-generic sets (1984) (0)
B An interview with Gerald E. Sacks (2015) (0)
Chapter 17: Reflection Principles (2014) (0)
Conservation Strength of The Infinite Pigeonhole Principle for Trees (2021) (0)
I„ DEFINABLE SETS WITHOUT Z„ INDUCTION (2010) (0)
Chapter 14: Five Cofinal Types (2014) (0)
Chapter 4: Consequences in Measure Theory (2014) (0)
$\Sigma\sb n$ definable sets without $\Sigma\sb n$ induction (1992) (0)
The density theorem (1984) (0)
1-Generic Degrees Bounding Minimal Degrees Revisited (2017) (0)
Southeast Asian Conference on Logic: Proceedings of the Logic Conference, Singapore, 1981 (1983) (0)
4 The theory of Π1 1-sets (2015) (0)
ISOLATION IN THE D.C.E. DEGREES (2009) (0)
FIFTEENTH ASIAN LOGIC CONFERENCE AN OFFICIAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC National Institute for Mathematical Sciences Daejeon, South Korea July 10–14, 2017 (2018) (0)
BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$-SETS (2019) (0)
BASIS THEOREMS FOR -SETS (2019) (0)
Special Section: Computability Theory and the Foundation of Mathematics (2017) (0)
NUMBER THEORY AND THE DESIGN OF FAST COMPUTER ALGORITHMS (2012) (0)
1 An introduction to higher recursion theory (2015) (0)
Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory (1999) (0)
Chapter 3: Consequences in Descriptive Set Theory (2014) (0)
C Notations and symbols (2015) (0)
Series Higher Randomness Notions and Their Lowness Properties (2007) (0)
Tame Σ[2] functions in α-recursion theory (1973) (0)
12 Review of classical algorithmic randomness (2015) (0)
Chapter 7: The Side-condition Method (2014) (0)
Chapter 12: Structure of Compact Spaces (2014) (0)
Minimalα-hyperdegrees (1984) (0)
Chapter 1: Baire Category Theorem and the Baire Category Numbers (2014) (0)
10 Rigidity and biinterpretability of hyperdegrees (2015) (0)
Participants and titles of lectures (1998) (0)
Notices (2002) (0)
Chapter 6: The S-spaces and the L-spaces (2014) (0)
Association for Symbolic Logic (1996) (0)
The theory of the α degrees is undecidable (2010) (0)
Chapter 5: Variations on the Souslin Hypothesis (2014) (0)
3 Admissibility and constructibility (2015) (0)
An alpha-Finite Injury Method of the Unbounded Type (1976) (0)
9 Independence results in recursion theory (2015) (0)
The minimal e-degree problem in fragments of Peano arithmetic (2005) (0)
8 The construction of Π1 1-sets (2015) (0)
Chapter 11: Biorthogonal Systems (2014) (0)
Chapter 16: Cardinal Arithmetic and (2014) (0)
Conference on Computability, Complexity and Randomness (2008) (0)

This paper list is powered by the following services:

Other Resources About Chong Chi Tat

en.wikipedia.org

What Schools Are Affiliated With Chong Chi Tat?

Chong Chi Tat is affiliated with the following schools: