Metarecursively enumerable sets and admissible ordinals

DOI10.1090/S0002-9904-1966-11416-7MaRDI QIDQ5528641zbMATHFDO

Authors Gerald E. Sacks

Publication date 1966

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

zbMATH Keywords

mathematical logic

Cites work

• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 3356759 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A Theorem on Hypersimple Sets
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Metarecursive sets
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• On the degrees less than 0'
• Post's Problem, Admissible Ordinals, and Regularity
• Recursive well-orderings
• 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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528641)