pith. sign in

arxiv: 1606.07518 · v1 · pith:HHAD47H4new · submitted 2016-06-24 · 💻 cs.LO · cs.LG

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

Alexandru Baltag (Institute for logic , Language , Computation. University of Amsterdam) , Nina Gierasimczuk (Institute for Logic , Sonja Smets (Institute for Logic This is my paper
classification 💻 cs.LO cs.LG
keywords inductivesolvabilitysolvableagentsagm-stylebeliefcharacterizationsconditioning
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.