One note on positive A-computable numberings

DOI10.1142/S1793557122502187zbMATH Open1504.03023OpenAlexW4220719574MaRDI QIDQ5876870FDOQ5876870

Authors: Marat Kh. Faizrahmanov 

Publication date: 2 February 2023

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557122502187

Recommendations

• Minimal generalized computable numberings and families of positive preorders
• Some absolute properties of \(A\)-computable numberings
• Positive presentations of families relative to \(e\)-oracles
• Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
• scientific article; zbMATH DE number 1873436

zbMATH Keywords

numberinglow setpositive numbering\(A\)-computable numbering

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Turing computability. Theory and applications
• Generalized computable numerations and nontrivial Rogers semilattices
• Title not available (Why is that?)
• Generalized computable universal numberings
• Positive enumerations

Cited In (2)

• Two theorems on minimal generalized computable numberings
• Title not available (Why is that?)

This page was built for publication: One note on positive A-computable numberings

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