scientific article; zbMATH DE number 749930

MaRDI QIDQ4764111zbMATH OpenFDO

Authors Kyriakos Kontostathis

Publication date 11 September 1995

zbMATH Keywords

combinatoricsCooper-Lachlan-Epstein theoremFriedberg Muchnik theoremlow simple setspriority argumentr.e. degreeSacks minimal degree theoremShoenfield jump inversion theoremTuring degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• A single minimal complement for the c.e. degrees
• A non-inversion theorem for the jump operator
• The combinatorics of the splitting theorem
• scientific article; zbMATH DE number 4150148
• A jump class of noncappable degrees

Cited in

(19)

• A non-inversion theorem for the jump operator
• Coding a family of sets
• The combinatorial Riemann mapping theorem
• Iterated combinatorial density theorems
• Combinatorics of Fulton's essential set
• A theorem on Molien type in combinatorics
• A combination theorem for PD(n)-pairs
• On a combinatorial theorem of Curtis Greene
• A combinatorial proof of a theorem of Freund
• Combinatorics of the \(z^{AB}\) theorem
• scientific article; zbMATH DE number 3935023 (Why is no real title available?)
• On a combinatorial principle of Hajnal and Komjáth
• scientific article; zbMATH DE number 29220 (Why is no real title available?)
• The combinatorics of the splitting theorem
• Many-Dimensional Combinatorial Ambartzumian's Formulae
• Relatively Recursively Enumerable Versus Relatively Σ₁ in Models of Peano Arithmetic
• Isolated d.c.e. degrees and _1 induction
• The Thurston operator for semi-finite combinatorics
• An easy priority-free proof of a theorem of Friedberg

This page was built for publication:

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