Metarecursive sets

DOI10.2307/2269621zbMath0156.25203OpenAlexW4213345207MaRDI QIDQ5536268

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

Related Items (18)

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

Cites Work

• The recursively enumerable degrees are dense
• On the degrees less than 0'
• 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)
• Recursively enumerable sets of positive integers and their decision problems
• Unnamed Item

This page was built for publication: Metarecursive sets