Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Chong, C.T.
1989.
Hyperhypersimple sets and Δ2 systems.
Annals of Pure and Applied Logic,
Vol. 44,
Issue. 1-2,
p.
25.
Chong, C.T.
1989.
Maximal sets and fragments of Peano arithmetic.
Nagoya Mathematical Journal,
Vol. 115,
Issue. ,
p.
165.
Slaman, Theodore A.
and
Woodin, W. Hugh
1989.
Mathematical Logic and Applications.
Vol. 1388,
Issue. ,
p.
178.
Chong, C. T.
and
Mourad, K. J.
1990.
Recursion Theory Week.
Vol. 1432,
Issue. ,
p.
33.
Groszek, Marcia
and
Mytilinaios, Michael
1990.
Recursion Theory Week.
Vol. 1432,
Issue. ,
p.
205.
Chong, C. T.
and
Mourad, K. J.
1992.
Σ_{𝑛} definable sets without Σ_{𝑛} induction.
Transactions of the American Mathematical Society,
Vol. 334,
Issue. 1,
p.
349.
Kontostathis, Kyriakos
1992.
TOPOLOGICAL FRAMEWORK FOR FINITE INJURY.
Mathematical Logic Quarterly,
Vol. 38,
Issue. 1,
p.
189.
Michalski, Grzegorz
1995.
Relatively Recursively Enumerable Versus Relatively Σ1in Models of Peano Arithmetic.
Mathematical Logic Quarterly,
Vol. 41,
Issue. 4,
p.
515.
Yang, Yue
1995.
Iterated trees and fragments of arithmetic.
Archive for Mathematical Logic,
Vol. 34,
Issue. 2,
p.
97.
1995.
1994–1995 Winter Meeting of the Association for Symbolic Logic.
Bulletin of Symbolic Logic,
Vol. 1,
Issue. 3,
p.
359.
Chong, C.T.
and
Yang, Yue
1997.
∑2 Induction and infinite injury priority arguments, part II Tame ∑2 coding and the jump operator.
Annals of Pure and Applied Logic,
Vol. 87,
Issue. 2,
p.
103.
Groszek, Marcia
and
Hummel, Tamara
1998.
∑2-constructions and I∑1.
Annals of Pure and Applied Logic,
Vol. 93,
Issue. 1-3,
p.
83.
YAMAZAKI, Takeshi
2000.
Model-theoretic studies on subsystems of second order arithmetic.
Tohoku Mathematical Publications,
Vol. 17,
Issue. 17,
p.
1.
Chong, C. T.
Qian, Lei
Slaman, Theodore A.
and
Yang, Yue
2001.
∑2 Induction and infinite injury priority arguments, part III: Prompt sets, minimal pairs and Shoenfield’s Conjecture.
Israel Journal of Mathematics,
Vol. 121,
Issue. 1,
p.
1.
Greenberg, Noam
2005.
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.
Bulletin of Symbolic Logic,
Vol. 11,
Issue. 3,
p.
398.
GREENBERG, NOAM
SHORE, RICHARD A.
and
SLAMAN, THEODORE A.
2006.
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES.
Journal of Mathematical Logic,
Vol. 06,
Issue. 01,
p.
49.
Mummert, Carl
2008.
Subsystems of second-order arithmetic between RCA0 and WKL0.
Archive for Mathematical Logic,
Vol. 47,
Issue. 3,
p.
205.
Chong, C.T.
Slaman, Theodore A.
and
Yang, Yue
2012.
Π11-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs.
Advances in Mathematics,
Vol. 230,
Issue. 3,
p.
1060.
2013.
2012–2013 Winter Meeting of The Association for Symbolic Logic.
The Bulletin of Symbolic Logic,
Vol. 19,
Issue. 4,
p.
497.
Li, Wei
2014.
Δ2 degrees without Σ1 induction.
Israel Journal of Mathematics,
Vol. 201,
Issue. 2,
p.
989.