On minimal pairs and minimal degrees in higher recursion theory

DOI10.1007/BF02007269zbMath0371.02018MaRDI QIDQ4146723

Wolfgang Maass

Publication date: 1977

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137939

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Related Items (1)

Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory

Cites Work

• Aspects of constructibility
• Maximal a-R.E. Sets
• The recursively enumerable α-degrees are dense
• Inadmissibility, tame R.E. sets and the admissible collapse
• The α-finite injury method
• Some minimal pairs of α-recursively enumerable degrees

This page was built for publication: On minimal pairs and minimal degrees in higher recursion theory