{"title":"论归纳问题的可解性:一个认知拓扑的研究","authors":"A. Baltag, Nina Gierasimczuk, S. Smets","doi":"10.4204/EPTCS.215.7","DOIUrl":null,"url":null,"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.","PeriodicalId":118894,"journal":{"name":"Theoretical Aspects of Rationality and Knowledge","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"On the Solvability of Inductive Problems: A Study in Epistemic Topology\",\"authors\":\"A. Baltag, Nina Gierasimczuk, S. Smets\",\"doi\":\"10.4204/EPTCS.215.7\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":118894,\"journal\":{\"name\":\"Theoretical Aspects of Rationality and Knowledge\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Aspects of Rationality and Knowledge\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.215.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Aspects of Rationality and Knowledge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.215.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 conditioning.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
