Minimal upper bounds for arithmetical degrees

This paper was inspired by Lerman [14] in which he proved various properties of upper bounds for the arithmetical degrees. The degrees which are upper bounds for the arithmetical degrees were first studied by Hodes [5] and Enderton and Putnam [5]. Enderton and Putnam [5] showed that if a is an upper...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of symbolic logic 1994-06, Vol.59 (2), p.516-528
1. Verfasser:	Kumabe, Masahiro
Format:	Artikel
Sprache:	eng
Schlagworte:	Degree of unsolvability Induction assumption Mathematical functions Mathematical induction Mathematical logic Mathematical theorems Natural numbers Number theoretic functions Oracles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!