Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 

 

Inductive definitions and computability


Author: Thomas J. Grilliot
Journal: Trans. Amer. Math. Soc. 158 (1971), 309-317
MSC: Primary 02E15
DOI: https://doi.org/10.1090/S0002-9947-1971-0304141-5
MathSciNet review: 0304141
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Sets inductively defined with respect to $ {\prod _0},{\Sigma _1}$, (nonmonotonic) $ {\prod _1}$ and $ {\Sigma _2}$ predicates are characterized in terms of the four chief notions of abstract recursion.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 02E15

Retrieve articles in all journals with MSC: 02E15


Additional Information

DOI: https://doi.org/10.1090/S0002-9947-1971-0304141-5
Keywords: Inductively defined sets, abstract computability, hyperprojective hierarchy
Article copyright: © Copyright 1971 American Mathematical Society