# On the Solvability of Inductive Problems: A Study in Epistemic Topology

arXiv: https://arxiv.org/abs/1606.07518 · HTML: https://mlsanity.com/paper/1606.07518/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Jun 2016.

## Built on by (most cited first, 3 of 3)

- [Learning to Act and Observe in Partially Observable Domains](https://mlsanity.com/paper/2109.06076/) (2021)
- [Who is Afraid of Minimal Revision?](https://mlsanity.com/paper/2511.22386/) (2025)
- [Common Knowledge Always, Forever](https://mlsanity.com/paper/2602.13914/) (2026)

## Abstract (arXiv)

We investigate the issues of inductive problem-solving and learning by doxastic agents. We provide topological characterizations of solvability and learnability, and we use them to prove that AGM-style belief revision is "universal", i.e., that every solvable problem is solvable by AGM conditioning.