On p-reducibility of numerations

DOI10.1016/0168-0072(93)90208-UzbMath0787.03034OpenAlexW1978542185MaRDI QIDQ688790

A. N. Degtev

Publication date: 28 November 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90208-u

zbMATH Keywords

limit pointrecursively enumerable setstotal recursive functions\(p\)-principal numerationcomputable numerations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (2)

On \(p \)-universal and \(p \)-minimal numberings ⋮ Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On p-reducibility of numerations