On the Universal Splitting Property

DOI10.1002/MALQ.19970430303MaRDI QIDQ4351920zbMATH OpenOpenAlexFDO

Authors Rodney G. Downey

Publication date 1 April 1998

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19970430303, http://hdl.handle.net/2292/3556

zbMATH Keywords

computably enumerable setsuniversal splitting property

Mathematics Subject Classification ID

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

Review text

The following theorems are proved. Theorem 1. If \(A\) is incomplete and has the universal splitting property, then \(A\) is \(\text{low}_2\). Theorem 2. There are computably enumerable sets with the universal splitting property which are not wtt-tops. Theorem 1 solves a question raised by \textit{K. Ambos-Spies} and \textit{P. A. Fejer} [J. Symb. Logic 53, 1110-1137 (1988; Zbl 0673.03027)] and \textit{R. Downey} and \textit{M. Stob} [Ann. Pure Appl. Logic 65, 1-106 (1993; Zbl 0792.03028)].

Recommendations

• The universal splitting property. II
• The Degrees of R.E. Sets Without the Universal Splitting Property
• Degree theoretical splitting properties of recursively enumerable sets
• Some reducibilities and splittings of recursively enumerable sets
• Splitting theorems and low degrees

Cites work

• Automorphisms of the lattice of recursively enumerable sets
• Subsets of hypersimple sets

Cited in

(7)

• Some generalizations of property \(B\) and the splitting property
• A remark on Beauville's splitting property
• The Lattice of Computably Enumerable Vector Spaces
• Introduction to autoreducibility and mitoticity
• scientific article; zbMATH DE number 434794 (Why is no real title available?)
• The universal splitting property. II
• Splitting theorems and low degrees

This page was built for publication: On the Universal Splitting Property

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