Maximal computability structures
From MaRDI portal
Publication:5283447
DOI10.1017/BSL.2016.26zbMATH Open1403.03072OpenAlexW2563311411MaRDI QIDQ5283447FDOQ5283447
Authors: Zvonko Iljazovic, Lucija Validžić
Publication date: 21 July 2017
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/bsl.2016.26
Recommendations
Computation over the reals, computable analysis (03D78) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computability on subsets of metric spaces.
- Computability on computable metric spaces
- Isometries and computability structures
- Title not available (Why is that?)
- Computably Isometric Spaces
- Title not available (Why is that?)
Cited In (9)
- Effective compactness and orbits of points under the isometry group
- \(\mathcal{D}\)-maximal sets
- Computability of Subsets of Metric Spaces
- Co-c.e. sets with disconnected complements
- Bound on maximum structural complexity of systems
- MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
- Dense computability structures
- Semicomputable manifolds in computable topological spaces
- Warsaw discs and semicomputability
This page was built for publication: Maximal computability structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283447)