Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Slaman, Theodore A.
and
Woodin, W. Hugh
1989.
Mathematical Logic and Applications.
Vol. 1388,
Issue. ,
p.
178.
Chong, C. T.
1989.
Mathematical Logic and Applications.
Vol. 1388,
Issue. ,
p.
1.
Chong, C.T.
1989.
Maximal sets and fragments of Peano arithmetic.
Nagoya Mathematical Journal,
Vol. 115,
Issue. ,
p.
165.
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.
Michalski, Grzegorz
1995.
Relatively Recursively Enumerable Versus Relatively Σ1in Models of Peano Arithmetic.
Mathematical Logic Quarterly,
Vol. 41,
Issue. 4,
p.
515.
1995.
1994–1995 Winter Meeting of the Association for Symbolic Logic.
Bulletin of Symbolic Logic,
Vol. 1,
Issue. 3,
p.
359.
Groszek, Marcia
and
Hummel, Tamara
1998.
∑2-constructions and I∑1.
Annals of Pure and Applied Logic,
Vol. 93,
Issue. 1-3,
p.
83.
1999.
Handbook of Computability Theory.
Vol. 140,
Issue. ,
p.
277.
2000.
Computable Structures and the Hyperarithmetical Hierarchy.
Vol. 144,
Issue. ,
p.
323.
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.
Friedman, Sy-David
Li, Wei
and
Wong, Tin Lok
2016.
Fragments of Kripke–Platek set theory and the metamathematics of $$\alpha $$ α -recursion theory.
Archive for Mathematical Logic,
Vol. 55,
Issue. 7-8,
p.
899.