Computable approximations of a chainable continuum with a computable endpoint

DOI10.1007/S00153-023-00891-5MaRDI QIDQ6139238zbMATH OpenOpenAlexFDO

Authors Zvonko Iljazovic

Publication date 18 January 2024

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-023-00891-5

zbMATH Keywords

chainable continuumcomputable setcomputable topological spacesemicomputable set

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60)

Cites work

• Chainable and circularly chainable co-r.e. sets in computable metric spaces
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• Co-c.e. sets with disconnected complements
• Co-c.e. spheres and cells in computable metric spaces
• Compact manifolds with computable boundaries
• Computability of 1-manifolds
• Computability of glued manifolds
• Computability of graphs
• Computability of products of chainable continua
• Computability on computable metric spaces
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.
• Computable intersection points
• Computable separation in topology, from \(T_{0}\) to \(T_{2}\)
• Computable subcontinua of semicomputable chainable Hausdorff continua
• Effectiveness for embedded spheres and balls
• Elementary computable topology
• scientific article; zbMATH DE number 3143695 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 53928 (Why is no real title available?)
• scientific article; zbMATH DE number 3541605 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Incomputability of Simply Connected Planar Continua
• Is the Mandelbrot set computable?
• On a Π⁰₁ Set of Positive Measure
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Plottable Real Number Functions and the Computable Graph Theorem
• Semicomputable manifolds in computable topological spaces

Cited in

(2)

• Computable subcontinua of circularly chainable continua
• Descriptive complexity of topological invariants

This page was built for publication: Computable approximations of a chainable continuum with a computable endpoint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139238)