Computability, Logic, AI Algorithms
Peer reviewed
Abstract
Abstract
In this article, we investigate the degree structures of various hyperspaces. One of our goals is to gain a topological understanding of higher-type computability using negative information, and to this end, we mainly explore the degree structures of hyperspaces whose ground types are endowed with cofinite topology or its relatives.
Direct answer
What can I do from this paper page?
Use this page to scan "Degree structures of hyperspaces over unusual ground types" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Computability, Logic, AI Algorithms research, save the paper, or map adjacent work.
Research areas
Follow related topics
Citation
BibTeX
@article{Kihara2026Degree,
title = {Degree structures of hyperspaces over unusual ground types},
author = {Takayuki Kihara and Keng Meng Ng},
journal = {Computability},
year = {2026},
doi = {10.1177/22113568261468521},
url = {https://doi.org/10.1177/22113568261468521}
}FAQ
Using this paper in a discovery workflow
How do I find related work for this paper?
Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.
How can I keep up with new Computability, Logic, AI Algorithms research papers?
Follow Computability, Logic, AI Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.
Can I cite this paper from this page?
This page includes a static BibTeX block for Degree structures of hyperspaces over unusual ground types. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.
Follow this research in Scollr
Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.
Get the app