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

Open Access
Authors
Publication date 24 June 2016
Journal Electronic Proceedings in Theoretical Computer Science
Event 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK)
Volume | Issue number 215
Pages (from-to) 81-98
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
  • Faculty of Science (FNWI)
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.
Document type Article
Note In: Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge : Carnegie Mellon University, Pittsburgh, USA, June 4-6, 2015.
Edited by R. Ramanujam.
Language English
Related publication On the Solvability of Inductive Problems: A Study in Epistemic Topology
Published at
https://doi.org/10.4204/EPTCS.215.7 (Final published version)
Other links
Downloads
1606.07518.pd (Final published version)
Permalink to this page
Back