Computability of graphs

DOI10.1002/MALQ.201900025MaRDI QIDQ5112388zbMATH OpenOpenAlexFDO

Authors Zvonko Iljazovic

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)

Recommendations

• Computability of pseudo-cubes
• Semicomputable manifolds in computable topological spaces
• Compact manifolds with computable boundaries
• Computing planarity in computable planar graphs
• Warsaw discs and semicomputability

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
• Computability of 1-manifolds
• 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 neighbourhoods of points in semicomputable manifolds
• Effectiveness for embedded spheres and balls
• Elements of differential topology. With a foreword by F. Thomas Farrell.
• 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 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Incomputability of Simply Connected Planar Continua
• Local computability of computable metric spaces and computability of co-c.e. continua
• On a Π⁰₁ Set of Positive Measure
• Plottable Real Number Functions and the Computable Graph Theorem
• Semicomputable manifolds in computable topological spaces
• Semirecursive Sets and Positive Reducibility

Cited in

(12)

• Man-machine theorem proving in graph theory
• Computability of pseudo-cubes
• Computational graph completion
• Computability of glued manifolds
• Computing planarity in computable planar graphs
• Strong computable type
• Computable approximations of a chainable continuum with a computable endpoint
• The surjection property and computable type
• Computable type of certain quotient spaces
• Computability of chainable graphs
• Computable approximations of semicomputable graphs
• Computable type and computably categorical spaces

This page was built for publication: Computability of graphs

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