Computability of pseudo-cubes

Annals of Pure and Applied Logic 171 (8):102823 (2020)
  Copy   BIBTEX

Abstract

We examine topological pairs (\Delta, \Sigma) which have computable type: if X is a computable topological space and f:\Delta \rightarrow X a topological embedding such that f(\Delta) and f(\Sigma) are semicomputable sets in X, then f(\Delta) is a computable set in X. It it known that (D, W) has computable type, where D is the Warsaw disc and W is the Warsaw circle. In this paper we identify a class of topological pairs which are similar to (D, W) and have computable type: we prove that (\Delta, \Sigma) has computable type if \Delta can somehow be approximated by a 2-cell whose boundary circle approximates \Sigma. Moreover, we examine higher-dimensional analogues of such pairs.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

External links

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

Through your library

Similar books and articles

Computability of graphs.Zvonko Iljazović - 2020 - Mathematical Logic Quarterly 66 (1):51-64.
Maximal computability structures.Zvonko Iljazović & Lucija Validžić - 2016 - Bulletin of Symbolic Logic 22 (4):445-468.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Aristotle’s Cubes and Consequential Implication.Claudio Pizzi - 2008 - Logica Universalis 2 (1):143-153.
An Analysis of Inconsistent and Incomplete Necker Cubes.Chris Mortensen - 2006 - Australasian Journal of Logic 4:216-225.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.
Lattice representations for computability theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
Cellularity of Pseudo-Tree Algebras.Jennifer Brown - 2006 - Notre Dame Journal of Formal Logic 47 (3):353-359.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
On the structure of linearly ordered pseudo-BCK-algebras.Anatolij Dvurečenskij & Jan Kühr - 2009 - Archive for Mathematical Logic 48 (8):771-791.

Analytics

Added to PP
2020-05-06

Downloads
28 (#565,512)

6 months
13 (#190,190)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations