Effectively infinite classes of numberings and fixed point theorems

DOI10.33048/SEMI.2023.20.094MaRDI QIDQ6587480FDOQ6587480

Authors: Marat Kh. Faizrahmanov 

Publication date: 14 August 2024

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

zbMATH Keywords

recursion theoremcomputable numberingprecomplete numberingeffective infinitycomplete numbering

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Turing computability. Theory and applications
• Theorie der Numerierungen I
• Fixed-point selection functions
• Effective extendability and fixed-points
• On weakly pre-complete positive equivalences
• Title not available (Why is that?)
• Computability and models. Perspectives east and west
• Title not available (Why is that?)
• Extremal numberings and fixed point theorems
• Some effectively infinite classes of enumerations
• Completely enumerated sets
• Index sets of quotient objects of the Post numeration
• Title not available (Why is that?)
• Fixed point theorems for precomplete numberings
• Precomplete numberings
• On inseparable pairs

This page was built for publication: Effectively infinite classes of numberings and fixed point theorems

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