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

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

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 con...

Full description

Bibliographic Details
Main Authors: Alexandru Baltag, Nina Gierasimczuk, Sonja Smets
Format: Article
Language:English
Published: Open Publishing Association 2016-06-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1606.07518v1
id doaj-c09a84335c6745e59067d55f702ab41f
record_format Article
spelling doaj-c09a84335c6745e59067d55f702ab41f2020-11-24T22:03:57ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802016-06-01215Proc. TARK 2015819810.4204/EPTCS.215.7:53On the Solvability of Inductive Problems: A Study in Epistemic TopologyAlexandru Baltag0Nina Gierasimczuk1Sonja Smets2 Institute for logic, Language and Computation. University of Amsterdam Institute for Logic, Language and Computation. University of Amsterdam 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.http://arxiv.org/pdf/1606.07518v1
collection DOAJ
language English
format Article
sources DOAJ
author Alexandru Baltag
Nina Gierasimczuk
Sonja Smets
spellingShingle Alexandru Baltag
Nina Gierasimczuk
Sonja Smets
On the Solvability of Inductive Problems: A Study in Epistemic Topology
Electronic Proceedings in Theoretical Computer Science
author_facet Alexandru Baltag
Nina Gierasimczuk
Sonja Smets
author_sort Alexandru Baltag
title On the Solvability of Inductive Problems: A Study in Epistemic Topology
title_short On the Solvability of Inductive Problems: A Study in Epistemic Topology
title_full On the Solvability of Inductive Problems: A Study in Epistemic Topology
title_fullStr On the Solvability of Inductive Problems: A Study in Epistemic Topology
title_full_unstemmed On the Solvability of Inductive Problems: A Study in Epistemic Topology
title_sort on the solvability of inductive problems: a study in epistemic topology
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2016-06-01
description 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.
url http://arxiv.org/pdf/1606.07518v1
work_keys_str_mv AT alexandrubaltag onthesolvabilityofinductiveproblemsastudyinepistemictopology
AT ninagierasimczuk onthesolvabilityofinductiveproblemsastudyinepistemictopology
AT sonjasmets onthesolvabilityofinductiveproblemsastudyinepistemictopology
_version_ 1725831365817008128

Similar Items