Computable neighbourhoods of points in semicomputable manifolds

&
Annals of Pure and Applied Logic 168 (4):840-859 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2016.10.015

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

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

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.
Computability of pseudo-cubes.Marko Horvat, Zvonko Iljazović & Bojan Pažek - 2020 - Annals of Pure and Applied Logic 171 (8):102823.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.Peter Dybjer & Denis Kuperberg - 2012 - Annals of Pure and Applied Logic 163 (2):122-131.
Computable de Finetti measures.Cameron E. Freer & Daniel M. Roy - 2012 - Annals of Pure and Applied Logic 163 (5):530-546.
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.
Computable irrational numbers with representations of surprising complexity.Ivan Georgiev, Lars Kristiansen & Frank Stephan - 2021 - Annals of Pure and Applied Logic 172 (2):102893.

Analytics

Added to PP
2016-10-20

Downloads
14 (#992,266)

6 months
3 (#1,206,449)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computability of graphs.Zvonko Iljazović - 2020 - Mathematical Logic Quarterly 66 (1):51-64.
Computability of pseudo-cubes.Marko Horvat, Zvonko Iljazović & Bojan Pažek - 2020 - Annals of Pure and Applied Logic 171 (8):102823.

Add more citations

References found in this work

Is the Mandelbrot set computable?Peter Hertling - 2005 - Mathematical Logic Quarterly 51 (1):5-18.

Add more references