New degree spectra of Polish spaces

DOI10.1134/S0037446621050116OpenAlexW3203110556MaRDI QIDQ820494

N. E. Zubov

Publication date: 27 September 2021

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446621050116

zbMATH Keywords

decidabilitycomputable analysisconnected spaceconstructive group

Mathematics Subject Classification ID

Abelian groups (20Kxx) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Related Items (3)

Separating notions in effective topology ⋮ On the main scientific achievements of Victor Selivanov ⋮ COMPUTABLY COMPACT METRIC SPACES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independence in computable algebra
• Algebraic structures computable without delay
• Hierarchies of torsion-free Abelian groups
• Enumerations and completely decomposable torsion-free abelian groups
• Some constructivizations of Abelian groups
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• New degree spectra of abelian groups
• Eliminating unbounded search in computable algebra
• Computable analysis and classification problems
• Degrees of non-computability of homeomorphism types of Polish spaces
• Computability on quasi-Polish spaces
• On degree spectra of topological spaces
• Computable Boolean algebras
• COMPUTABLE ABELIAN GROUPS
• Limitwise monotonic sequences and degree spectra of structures
• RELATIVE TO ANY NON-HYPERARITHMETIC SET
• Spectra of highn and non-lown degrees
• THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
• Path integral quantisation of the open strings normal modes
• Every Set has a Least Jump Enumeration
• Effective procedures in field theory
• Spectra of Algebraic Fields and Subfields
• Orderings with αth Jump Degree 0 (α)
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Torsion-free abelian groups with optimal Scott families
• Computable copies of ℓ p 1
• Analytic computable structure theory and $L^p$ spaces
• Computable topological groups and Pontryagin duality
• Degrees of Structures
• Jump degrees of torsion-free abelian groups
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• CONSTRUCTIVE ALGEBRAS I
• Computably Isometric Spaces
• Computable Algebra, General Theory and Theory of Computable Fields
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
• The structure of compact groups. A primer for the student -- a handbook for the expert

This page was built for publication: New degree spectra of Polish spaces