Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets

DOI10.1134/S0037446623010172OpenAlexW4322576927MaRDI QIDQ2687468

M. Kh. Fajzrakhmanov

Publication date: 2 March 2023

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446623010172

zbMATH Keywords

numbering\( p \)-minimal numbering\( p \)-reducibility\( p \)-universal numbering\( \Sigma^0_{d+1} \)-computable numbering\( e \)-minimal numbering\( e \)-reducibility\( e \)-universal numbering

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx)

Related Items (1)

A family with a single minimal but not least numbering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On p-reducibility of numerations
• On \(p \)-universal and \(p \)-minimal numberings
• Turing Computability
• ON REDUCIBILITIES OF NUMERATIONS

This page was built for publication: Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets