- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computable Stone spaces
Annals of Pure and Applied Logic 174 (9):103304 (2023)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Banach-Stone-like results for combinatorial Banach spaces.C. Brech & C. Piña - 2021 - Annals of Pure and Applied Logic 172 (8):102989.
Punctual definability on structures.Iskander Kalimullin, Alexander Melnikov & Antonio Montalban - 2021 - Annals of Pure and Applied Logic 172 (8):102987.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Dependence relations in computably rigid computable vector spaces.Rumen D. Dimitrov, Valentina S. Harizanov & Andrei S. Morozov - 2005 - Annals of Pure and Applied Logic 132 (1):97-108.
Computable de Finetti measures.Cameron E. Freer & Daniel M. Roy - 2012 - Annals of Pure and Applied Logic 163 (5):530-546.
Computable neighbourhoods of points in semicomputable manifolds.Zvonko Iljazović & Lucija Validžić - 2017 - Annals of Pure and Applied Logic 168 (4):840-859.
Finite computable dimension and degrees of categoricity.Barbara F. Csima & Jonathan Stephenson - 2019 - Annals of Pure and Applied Logic 170 (1):58-94.
Computable fields and the bounded Turing reduction.Rebecca M. Steiner - 2012 - Annals of Pure and Applied Logic 163 (6):730-742.
Randomness for computable measures and initial segment complexity.Rupert Hölzl & Christopher P. Porter - 2017 - Annals of Pure and Applied Logic 168 (4):860-886.
Analytics
Added to PP
2023-06-14
Downloads
15 (#1,100,648)
6 months
7 (#973,747)
2023-06-14
Downloads
15 (#1,100,648)
6 months
7 (#973,747)
Historical graph of downloads
Author's Profile
Citations of this work
Computable Topological Groups.K. O. H. Heer Tern, Alexander G. Melnikov & N. G. Keng Meng - forthcoming - Journal of Symbolic Logic:1-33.
Computably and punctually universal spaces.Ramil Bagaviev, Ilnur I. Batyrshin, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov & Keng Meng Ng - 2025 - Annals of Pure and Applied Logic 176 (1):103491.
References found in this work
Computably Compact Metric Spaces.Rodney G. Downey & Alexander G. Melnikov - 2023 - Bulletin of Symbolic Logic 29 (2):170-263.
Closed choice and a uniform low basis theorem.Vasco Brattka, Matthew de Brecht & Arno Pauly - 2012 - Annals of Pure and Applied Logic 163 (8):986-1008.
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Computability of polish spaces up to homeomorphism.Matthew Harrison-Trainor, Alexander Melnikov & Keng Meng Ng - 2020 - Journal of Symbolic Logic 85 (4):1664-1686.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-76d885d765-2fk9r uwo