Computability of graphs

DOI10.1002/malq.201900025OpenAlexW3012260425MaRDI QIDQ5112388

Zvonko Iljazović

Publication date: 29 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201900025

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (2)

Strong computable type ⋮ Computable approximations of a chainable continuum with a computable endpoint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable neighbourhoods of points in semicomputable manifolds
• Co-c.e. sets with disconnected complements
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.
• Semicomputable manifolds in computable topological spaces
• Computability on computable metric spaces
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• Local computability of computable metric spaces and computability of co-c.e. continua
• Elements of Differential Topology
• Plottable Real Number Functions and the Computable Graph Theorem
• Computable intersection points
• Incomputability of Simply Connected Planar Continua
• Effectiveness for Embedded Spheres and Balls
• Computability of 1-manifolds
• Semirecursive Sets and Positive Reducibility
• On a Π⁰₁ Set of Positive Measure

This page was built for publication: Computability of graphs