Definable incompleteness and Friedberg splittings

DOI10.2178/jsl/1190150104zbMath1011.03031OpenAlexW2104910355MaRDI QIDQ3149989

Russell G. Miller

Publication date: 29 May 2003

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

Full work available at URL: https://doi.org/10.2178/jsl/1190150104

zbMATH Keywords

orbitsautomorphismssplittingscomputably enumerable setsPost problem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Friedberg splittings of recursively enumerable sets
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Definable properties of the computably enumerable sets
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Jumps of Hemimaximal Sets
• Post's program and incomplete recursively enumerable sets.
• The Δ₃⁰-automorphism method and noninvariant classes of degrees

This page was built for publication: Definable incompleteness and Friedberg splittings