Skip to main content Accessibility help
  • Online publication date: March 2017

Undecidable theories and reversemathematics

[1] C.G., Jockusch, Jr., Π0/1 classes and Boolean combinations of recursively enumerable sets,The Journal of Symbolic Logic, vol. 39 (1974), pp. 95–96.
[2] J., Mohrherr, A refinement of low n and high n for the r.e. degrees,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 32 (1986), pp. 5–12.
[3] Stephen G., Simpson, Subsystems of second order arithmetic, Springer-Verlag, 1998.