The Priority Method I

DOI10.1002/MALQ.19670130102MaRDI QIDQ5534209zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1967

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

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

zbMATH Keywords

mathematical logic

Cited in

(14)

• Structural interactions of the recursively enumerable T- and W-degrees
• Completely mitotic r. e. degrees
• Classification of degree classes associated with r.e. subspaces
• Splitting theorems in recursion theory
• Completely mitotic c.e. degrees and non-jump inversion
• Space-efficient informational redundancy
• Some observations on mitotic sets
• On effectively hypersimple sets
• Non-cupping, measure and computably enumerable splittings
• The universal splitting property. II
• Splitting properties of r.e. sets and degrees
• Recursively enumerable sets and degrees
• Mitotic recursively enumerable sets
• Autoreducibility, mitoticity, and immunity

This page was built for publication: The Priority Method I

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