Computably and punctually universal spaces

DOI10.1016/J.APAL.2024.103491MaRDI QIDQ6614035FDOQ6614035

Nikolay Bazhenov, R. A. Kornev, Ramil Bagaviev, Alexander Melnikov, Heer Tern Koh, Keng Meng Ng, Dmitry Bushtets, M. V. Dorzhieva, I. I. Batyrshin

Publication date: 7 October 2024

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

universal spacescomputable Polish spacecontinuous functions on the unit intervalprimitive recursive analysispunctual

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30) Constructive and recursive analysis (03F60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Space-filling curves
• Computable structures and the hyperarithmetical hierarchy
• The computable dimension of ordered abelian groups
• A note on computable real fields
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Some geometric and dynamical properties of the Urysohn space
• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields
• Existence and uniqueness of structures computable in polynomial time
• Nicht konstruktiv beweisbare Sätze der Analysis
• Recursively presentable prime models
• Closed choice and a uniform low basis theorem
• Borel complexity and computability of the Hahn-Banach theorem
• The Urysohn space embeds in Banach spaces in just one way
• Sur un espace métrique séparable universel
• Recursive analysis
• Recursive Real Numbers
• Algebraic structures computable without delay
• Théorie des opérations linéaires.
• Computable structures and operations on the space of continuous functions
• Computable copies of ℓ p 1
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Computably Isometric Spaces
• COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
• Primitive recursive ordered fields and some applications
• Sur un espace métrique universel. I, II.
• On Computable Field Embeddings and Difference Closed Fields
• Eine Bemerkung über die Unzerlegbarkeit von Polynomen.
• COMPUTABLE POLISH GROUP ACTIONS
• UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
• On computable numbers, with an application to the Entscheidungsproblem. A correction.
• Computable Stone spaces
• COMPUTABLY COMPACT METRIC SPACES
• Finitism, imperative programs and primitive recursion

This page was built for publication: Computably and punctually universal spaces

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