On complete and almost complete constructive metric spaces

DOI10.3103/S0027132225700408MaRDI QIDQ6850581zbMATH OpenFDO

Authors Marat Kh. Faizrahmanov

Publication date 2 March 2026

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0027132225700408

zbMATH Keywords

Cantor spacecomplete metric spaceconstructive metric spaceconstructive real

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Model theory (03Cxx) Computability and recursion theory (03Dxx)

Cites work

• Algorithmic randomness and complexity.
• Almost computably enumerable families of sets
• An improved zero-one law for algorithmically random sequences
• Automata Studies. (AM-34)
• Computability and randomness
• Computable structures and the hyperarithmetical hierarchy
• Decidability of the “almost all” theory of degrees
• Enumerations, countable structures and Turing degrees
• scientific article; zbMATH DE number 3950399 (Why is no real title available?)
• scientific article; zbMATH DE number 3183053 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3446864 (Why is no real title available?)
• Limitwise monotonic sets of reals
• Relative to any non-hyperarithmetic set
• Relative to any nonrecursive set
• The Slaman-Wehner theorem in higher recursion theory
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: On complete and almost complete constructive metric spaces

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