Metarecursively enumerable sets and admissible ordinals

DOI10.1090/S0002-9904-1966-11416-7zbMath0149.24703MaRDI QIDQ5528641

Gerald E. Sacks

Publication date: 1966

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

mathematical logic

Related Items (5)

Π₁¹ Sets, ω-Sets, and metacompleteness ⋮ Metarecursively enumerable sets and their metadegrees ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES

Cites Work

• On the degrees less than 0'
• Recursive well-orderings
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Post's Problem, Admissible Ordinals, and Regularity
• Metarecursive sets
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• A Theorem on Hypersimple Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Metarecursively enumerable sets and admissible ordinals