Computable Stone spaces

, &
Annals of Pure and Applied Logic 174 (9):103304 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2023.103304

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,574

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Computability of polish spaces up to homeomorphism.Matthew Harrison-Trainor, Alexander Melnikov & Keng Meng Ng - 2020 - Journal of Symbolic Logic 85 (4):1664-1686.
Computability of compact operators on computable Banach spaces with bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
Computable functors and effective interpretability.Matthew Harrison-Trainor, Alexander Melnikov, Russell Miller & Antonio Montalbán - 2017 - Journal of Symbolic Logic 82 (1):77-97.
Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
Analytic computable structure theory and $$L^p$$Lp -spaces part 2.Tyler Brown & Timothy H. McNicholl - 2020 - Archive for Mathematical Logic 59 (3-4):427-443.
Chainable and circularly chainable semicomputable sets in computable topological spaces.Eugen Čičković, Zvonko Iljazović & Lucija Validžić - 2019 - Archive for Mathematical Logic 58 (7-8):885-897.
The Modal Logic of Stone Spaces: Diamond as Derivative.Guram Bezhanishvili - 2010 - Review of Symbolic Logic 3 (1):26-40.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Computable randomness and betting for computable probability spaces.Jason Rute - 2016 - Mathematical Logic Quarterly 62 (4-5):335-366.
The property “arithmetic-is-recursive” on a cone.Uri Andrews, Matthew Harrison-Trainor & Noah Schweber - 2021 - Journal of Mathematical Logic 21 (3).
Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
Computable bi-embeddable categoricity.Luca San Mauro, Nikolay Bazhenov, Ekaterina Fokina & Dino Rossegger - 2018 - Algebra and Logic 5 (57):392-396.
Effectivity in Spaces with Admissible Multirepresentations.Matthias Schröder - 2002 - Mathematical Logic Quarterly 48 (S1):78-90.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.

Analytics

Added to PP
2023-06-14

Downloads
13 (#1,043,598)

6 months
7 (#441,920)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

Citations of this work

Add more citations

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.
Hiearchies of Boolean algebras.Lawrence Feiner - 1970 - Journal of Symbolic Logic 35 (3):365-374.

View all 9 references / Add more references