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

Alexandru Baltag
(Institute for logic, Language and Computation. University of Amsterdam)
Nina Gierasimczuk
(Institute for Logic, Language and Computation. University of Amsterdam)
Sonja Smets
(Institute for Logic, Language and Computation. University of Amsterdam)

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 R Ramanujam: Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015), Carnegie Mellon University, Pittsburgh, USA, June 4-6, 2015, Electronic Proceedings in Theoretical Computer Science 215, pp. 81–98.
Published: 23rd June 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.215.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org