Metarecursive sets

DOI10.2307/2269621zbMATH Open0156.25203OpenAlexW4213345207MaRDI QIDQ5536268FDOQ5536268

Authors: Gerald E. Sacks, Georg Kreisel 

Publication date: 1965

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2269621

zbMATH Keywords

mathematical logic

Cites Work

• Title not available (Why is that?)
• The recursively enumerable degrees are dense
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Recursively enumerable sets of positive integers and their decision problems
• On the degrees less than 0'
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited In (18)

• Atomic models higher up
• Metarecursively enumerable sets and admissible ordinals
• Computability in uncountable binary trees
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• Descriptive characterizations of computational complexity
• On a positive set theory with inequality
• Persistent and invariant formulas relative to theories of higher order
• Theories of Rogers semilattices of analytical numberings
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Enumeration reducibility and computable structure theory
• Post's problem without admissibility
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Effective oracles
• Transfinite recursion and computation in the iterative conception of set
• On the reducibility of \(\Pi_ 1^ 1\) sets
• Barwise: Infinitary Logic and Admissible Sets
• Ordinal machines and admissible recursion theory
• Minimal Covers and Hyperdegrees

This page was built for publication: Metarecursive sets

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