Definable incompleteness and Friedberg splittings

DOI10.2178/JSL/1190150104zbMATH Open1011.03031OpenAlexW2104910355MaRDI QIDQ3149989FDOQ3149989

Authors: Russell 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

Recommendations

• Definable properties of the computably enumerable sets
• ∑ n Definable Sets without ∑ n Induction
• Splitting theorems and the jump operator
• Friedberg splittings of recursively enumerable sets
• On a Conjecture of Kleene and Post

zbMATH Keywords

automorphismsorbitssplittingscomputably enumerable setsPost problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Tarski’s Undefinability Theorem and the Diagonal Lemma
• Stepping up lemmas in definable partitions

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

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