{"id":1691,"date":"2019-10-17T14:39:44","date_gmt":"2019-10-17T06:39:44","guid":{"rendered":"http:\/\/tsinghualogic.net\/JRC\/?p=1691"},"modified":"2019-10-17T14:39:46","modified_gmt":"2019-10-17T06:39:46","slug":"talk-inductive-knowledge","status":"publish","type":"post","link":"http:\/\/tsinghualogic.net\/JRC\/talk-inductive-knowledge\/","title":{"rendered":"[talk] Inductive Knowledge"},"content":{"rendered":"<blockquote><p>Time: 2019 Oct 25,\u00a013:30-16:00<br \/>\nVenue: \u65b0\u658b324, Tsinghua Univ.<\/p><\/blockquote>\n<p><strong>Speaker:<\/strong>\u00a0 Kevin Kelly (Carnegie Mellon University)<\/p>\n<p><img decoding=\"async\" loading=\"lazy\" class=\"size-full wp-image-1690 aligncenter\" src=\"http:\/\/tsinghualogic.net\/JRC\/wp-content\/uploads\/2019\/10\/Kelley.jpeg\" alt=\"\" width=\"195\" height=\"225\" srcset=\"http:\/\/tsinghualogic.net\/JRC\/wp-content\/uploads\/2019\/10\/Kelley.jpeg 195w, http:\/\/tsinghualogic.net\/JRC\/wp-content\/uploads\/2019\/10\/Kelley-173x200.jpeg 173w\" sizes=\"(max-width: 195px) 100vw, 195px\" \/><\/p>\n<p><strong>Abstract<\/strong>:<\/p>\n<p style=\"padding-left: 40px; text-align: left;\">Inductive knowledge is knowledge that goes beyond the information available.\u00a0Inductive skeptics think there isn&#8217;t any such thing. Maybe they are right&#8212;standard modal theories of knowledge (tracking, safety) are too strict to allow for even banal inductive inferences.\u00a0But maybe they are wrong: perhaps failure to achieve those standards is justified because they do not apply.\u00a0I will sketch a simple semantics for the semantics of inductive knowledge and will illustrate some of its interesting consequences.\u00a0One of them is a normative argument for the old, quasi-sociological view in the philosophy of science that there is (can be?) no &#8220;logic of discovery&#8221;.\u00a0The idea is that if inductive knowability implies learnability, then inductive knowability cannot be closed under deductive consequence, so inductive learnability must not be necessary for inductive knowability.\u00a0I will also discuss the surprising consequence that you can inductively know your own Moore sentence: &#8220;I know that A but A is false&#8221;, even if you are deductively cogent&#8212;something impossible in standard epistemic logic. The presented semantics is a much-streamlined version of the semantics presented in &#8220;A Computational Learning Semantics for Inductive Empirical Knowledge&#8221;, Logical\/Informational Dynamics, a Festschrift for Johan van Benthem, A. Baltag and S. Smets eds., Springer: 2014.<\/p>\n<p><strong>CV<\/strong>:<\/p>\n<p style=\"padding-left: 40px; text-align: left;\"><span class=\"md-plain\">\u00a0<\/span><span class=\"md-plain\"><span lang=\"ZH-CN\">Professor in Philosophy department, Director of the Center for Formal Epistemology at Carnegie Mellon University, author of &#8220;The Logic of Reliable Inquiry&#8221; (Oxford, 1996). His recent work concerns reliable belief revision, the solution of methodological regresses, and efficient convergence. His research areas include Ockham&#8217;s razor and realism, Qualitative belief, and the lottery paradox, Learning semantics for epistemic logic, Analogies between empirical and formal reasoning, The learning power of belief revision, Learning theory and the philosophy of science, Infinite methodological regresses.<\/span><\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Time: 2019 Oct 25,\u00a013:30-16:00 Venue: \u65b0\u658b324, Tsinghua U [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/posts\/1691"}],"collection":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/comments?post=1691"}],"version-history":[{"count":1,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/posts\/1691\/revisions"}],"predecessor-version":[{"id":1692,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/posts\/1691\/revisions\/1692"}],"wp:attachment":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/media?parent=1691"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/categories?post=1691"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/tags?post=1691"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}