Friedberg numberings of families of partial computable functionals

DOI10.33048/SEMI.2019.16.020MaRDI QIDQ2003244zbMATH OpenOpenAlexFDO

Authors S. S. Ospichev

Publication date 16 July 2019

Published in Sibirskie Elektronnye 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)

Recommendations

• Computable positive and Friedberg numberings in hyperarithmetic
• scientific article; zbMATH DE number 2167508
• Friedberg numberings in the Ershov hierarchy
• On decomposition of Gödelnumberings into Friedbergnumberings
• Some absolute properties of \(A\)-computable numberings

Cites work

• scientific article; zbMATH DE number 1746561 (Why is no real title available?)
• scientific article; zbMATH DE number 2167508 (Why is no real title available?)
• scientific article; zbMATH DE number 1873436 (Why is no real title available?)
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• An easy priority-free proof of a theorem of Friedberg
• Computability and numberings
• Computable functionals of finite types
• Elementary Theories for Rogers Semilattices
• Everywhere-defined continuous functionals
• Families without minimal numberings
• Friedberg numberings in the Ershov hierarchy
• Generalized computable numerations and nontrivial Rogers semilattices
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Local structure of Rogers semilattices of Σn 0-computable numberings
• On the existence of universal numberings for finite families of d.c.e. sets
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Two existence theorems for computable numerations

Cited in

(8)

• scientific article; zbMATH DE number 2167508 (Why is no real title available?)
• Some absolute properties of \(A\)-computable numberings
• \(\varepsilon\)-principal numberings
• Effectively infinite classes of numberings and computable families of reals
• A note on direct sums of Friedbergnumberings
• Computable positive and Friedberg numberings in hyperarithmetic
• scientific article; zbMATH DE number 7139148 (Why is no real title available?)
• A note on partial numberings

This page was built for publication: Friedberg numberings of families of partial computable functionals

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