Friedberg numberings of families of partial computable functionals

DOI10.33048/semi.2019.16.020zbMath1432.03081OpenAlexW3015946520MaRDI QIDQ2003244

S. S. Ospichev

Publication date: 16 July 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.020

zbMATH Keywords

computable numberingspositive numberingFriedberg numberingminimal numberingRogers semilatticecomputable morphismspartial computable functionals

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An easy priority-free proof of a theorem of Friedberg
• Two existence theorems for computable numerations
• Computable functionals of finite types
• Everywhere-defined continuous functionals
• Families without minimal numberings
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Elementary Theories for Rogers Semilattices
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Local structure of Rogers semilattices of Σn 0-computable numberings
• On the existence of universal numberings for finite families of d.c.e. sets
• Friedberg numberings in the Ershov hierarchy