Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Byerly, Robert E.
1984.
DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY.
Mathematical Logic Quarterly,
Vol. 30,
Issue. 32-34,
p.
499.
Byerly, Robert E.
1985.
Harvey Friedman's Research on the Foundations of Mathematics.
Vol. 117,
Issue. ,
p.
339.
Case, John
1991.
Effectivizing Inseparability.
Mathematical Logic Quarterly,
Vol. 37,
Issue. 7,
p.
97.