Some Properties of Recursively Inseparable Sets

DOI10.1002/MALQ.19700160208MaRDI QIDQ5606579zbMATH OpenOpenAlexFDO

Authors J. P. Cleave

Publication date 1970

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

Full work available at URL https://doi.org/10.1002/malq.19700160208

Mathematics Subject Classification ID

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

Cited in

(10)

• Comparison of linear reducibility with other reducibilities of tabular type
• A category of partial recursive functions
• Several results on upper semilattices and m-degrees
• btt-reducibility
• Algebraic properties of number theories
• Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees
• On inseparable pairs
• Computable categoricity for algebraic fields with splitting algorithms
• Conjunctive degrees and cylinders
• Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility

This page was built for publication: Some Properties of Recursively Inseparable Sets

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