PP-2015-13: On the Solvability of Inductive Problems: A Study in Epistemic Topology

PP-2015-13: Baltag, Alexandru and Gierasimczuk, Nina and Smets, Sonja (2015) On the Solvability of Inductive Problems: A Study in Epistemic Topology. [Report]

[img]
Preview
Text (Full Text)
PP-2015-13.text.pdf

Download (346kB) | Preview
[img] Text (Abstract)
PP-2015-13.abstract.txt

Download (504B)

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.

Item Type: Report
Report Nr: PP-2015-13
Series Name: Prepublication (PP) Series
Year: 2015
Uncontrolled Keywords: Learning Theory, Topological Epistemology, Belief Revision
Subjects: Logic
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/524

Actions (login required)

View Item View Item