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.
Cite
CITATION STYLE
APA
Baltag, A., Gierasimczuk, N., & Smets, S. (2016). On the solvability of inductive problems: A study in epistemic topology. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 215, pp. 81–98). Open Publishing Association. https://doi.org/10.4204/EPTCS.215.7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free