Minimal numerations of positively computable families

DOI10.1007/BF00750228zbMath0819.03036OpenAlexW2073172302MaRDI QIDQ1892813

S. A. Badaev

Publication date: 26 June 1995

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187684

zbMATH Keywords

computable numerationscomputable family of recursively enumerable setssemilattices of computable numerations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (2)

A family with a single minimal but not least numbering ⋮ On universal pairs in the Ershov hierarchy

Cites Work

• Positive numerations of families with one-valued numerations
• A unique positive enumeration
• Trial and error predicates and the solution to a problem of Mostowski

This page was built for publication: Minimal numerations of positively computable families