Metarecursively enumerable sets and admissible ordinals

DOI10.1090/S0002-9904-1966-11416-7zbMATH Open0149.24703MaRDI QIDQ5528641FDOQ5528641

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

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

Cited In (5)

• 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
• Barwise: Infinitary Logic and Admissible Sets

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)