Computably and punctually universal spaces
type: Item
instance of: scholarly article
title: Computably and punctually universal spaces
author: Ramil Bagaviev
author: I. I. Batyrshin
author: Nikolay Bazhenov
author: Dmitry Bushtets
author: M. V. Dorzhieva
author: Heer Tern Koh
author: R. A. Kornev
author: Alexander Melnikov
author: Keng Meng Ng
published in: Annals of Pure and Applied Logic
publication date: 2024-10-07T00:00:00Z
Mathematics Subject Classification ID: 03D78
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D80
Mathematics Subject Classification ID: 03F60
zbMATH DE Number: 7921867
zbMATH Keywords: universal spaces
zbMATH Keywords: punctual
zbMATH Keywords: computable Polish space
zbMATH Keywords: continuous functions on the unit interval
zbMATH Keywords: primitive recursive analysis
MaRDI profile type: MaRDI publication profile
cites work: Q3910522
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: Existence and uniqueness of structures computable in polynomial time
cites work: Théorie des opérations linéaires.
cites work: FOUNDATIONS OF ONLINE STRUCTURE THEORY
cites work: Closed choice and a uniform low basis theorem
cites work: Computable Stone spaces
cites work: Borel complexity and computability of the Hahn-Banach theorem
cites work: COMPUTABLY COMPACT METRIC SPACES
cites work: Q5155667
cites work: Q4956005
cites work: Effective procedures in field theory
cites work: The computable dimension of ordered abelian groups
cites work: UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
cites work: Recursive analysis
cites work: Recursively presentable prime models
cites work: The Urysohn space embeds in Banach spaces in just one way
cites work: On Computable Field Embeddings and Difference Closed Fields
cites work: COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
cites work: Algebraic structures computable without delay
cites work: Q3338243
cites work: Finitism, imperative programs and primitive recursion
cites work: A note on computable real fields
cites work: Computable copies of ℓ p 1
cites work: Some geometric and dynamical properties of the Urysohn space
cites work: Computably Isometric Spaces
cites work: COMPUTABLE POLISH GROUP ACTIONS
cites work: Computable structures and operations on the space of continuous functions
cites work: Q4217607
cites work: Q3994907
cites work: Computable Algebra, General Theory and Theory of Computable Fields
cites work: Recursive Real Numbers
cites work: Space-filling curves
cites work: Sur un espace métrique séparable universel
cites work: Q3949039
cites work: Nicht konstruktiv beweisbare Sätze der Analysis
cites work: Q3260574
cites work: Primitive recursive ordered fields and some applications
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: On computable numbers, with an application to the Entscheidungsproblem. A correction.
cites work: Sur un espace métrique universel. I, II.
cites work: Eine Bemerkung über die Unzerlegbarkeit von Polynomen.
cites work: Q4485693
cites work: Q5848897
cites work: Q3849893
DOI: 10.1016/J.APAL.2024.103491
description: scientific article; zbMATH DE number 7921867