Maximal sets in \(\alpha\)-recursion theory

DOI10.1007/BF02764882zbMath0261.02030MaRDI QIDQ2560401

Stephen G. Simpson, Manuel Lerman

Publication date: 1973

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Large cardinals (03E55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)

Related Items (10)

Power set recursion ⋮ Major subsets of \(\alpha\)-recursively enumerable sets ⋮ Almost local non-α-recursiveness ⋮ Cohesive Sets: Countable and Uncountable ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ α-Degrees of maximal α-r.e. sets ⋮ Hyperhypersimple sets and \(\Delta _ 2\) systems ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY ⋮ Global and local admissibility. II. Major subsets and automorphisms ⋮ Hyperhypersimple supersets in admissible recursion theory

Cites Work

• Unnamed Item
• Post's Problem, Admissible Ordinals, and Regularity
• A hierarchy of formulas in set theory
• The fine structure of the constructible hierarchy
• Consistency-Proof for the Generalized Continuum-Hypothesis

This page was built for publication: Maximal sets in \(\alpha\)-recursion theory