Search everything
Home
Research Intelligence
Expert Finder
Scinapse Trends
Paper Search
Journal Search
Collections
Favorites
History
Submit Feedback
doi.org/10.1017/jsl.2020.67
Original paper
COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
Matthew Harrison‐Trainor
7
,
Alexander Melnikov
14
,
Keng Meng Ng
11
View all 3 authors
Journal of Symbolic Logic
Volume: 85, Issue: 4, Pages: 1664 - 1686
Published
: Oct 26, 2020
15
Citations
Source
Cite
Basic Info
Analytics
References
Citations
Paper Fields
Separable space
Pure mathematics
Discrete mathematics
Topological space
Computable analysis
Operating system
Duality (order theory)
Computer science
Computability
Homeomorphism (graph theory)
Computable number
Mathematics
Mathematical analysis
Path (computing)
Polish space
Combinatorics
Programming language
Space (punctuation)
Locally compact space
Paper Details
Title
COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
DOI
doi.org/10.1017/jsl.2020.67
Published Date
Oct 26, 2020
Journal
Journal of Symbolic Logic
Volume
85
Issue
4
Pages
1664 - 1686
Notes
History
View all history