On \(p \)-universal and \(p \)-minimal numberings

DOI10.1134/S0037446622020148OpenAlexW4225853589MaRDI QIDQ2123092

M. Kh. Fajzrakhmanov

Publication date: 8 April 2022

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

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

zbMATH Keywords

computable numberinguniversal numbering\( A \)-computable numbering\( p \)-minimal numbering\( p \)-reducibility\( p \)-universal numbering

Mathematics Subject Classification ID

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

Related Items (2)

Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets ⋮ A family with a single minimal but not least numbering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On p-reducibility of numerations
• Universal generalized computable numberings and hyperimmunity
• Some absolute properties of \(A\)-computable numberings
• Generalized computable universal numberings
• Minimal generalized computable enumerations and high degrees
• Turing Computability
• ON REDUCIBILITIES OF NUMERATIONS
• The Degrees of Hyperimmune Sets
• On \(p\)-reducibility of computable numerations

This page was built for publication: On \(p \)-universal and \(p \)-minimal numberings