On the Solvability of Inductive Problems: A Study in Epistemic Topology
arXiv:1606.07518 · doi:10.4204/EPTCS.215.7
Abstract
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.
In Proceedings TARK 2015, arXiv:1606.07295