{"id":4211,"date":"2022-02-19T02:42:22","date_gmt":"2022-02-18T18:42:22","guid":{"rendered":"http:\/\/tsinghualogic.net\/JRC\/?page_id=4211"},"modified":"2025-12-10T17:30:32","modified_gmt":"2025-12-10T09:30:32","slug":"past-events","status":"publish","type":"page","link":"http:\/\/tsinghualogic.net\/JRC\/past-events\/","title":{"rendered":"2019-2024 Past Events"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"4211\" class=\"elementor elementor-4211\" data-elementor-settings=\"[]\">\n\t\t\t\t\t\t\t<div class=\"elementor-section-wrap\">\n\t\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-086f5e5 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"086f5e5\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-a721035\" data-id=\"a721035\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-1b4ab0a elementor-widget elementor-widget-heading\" data-id=\"1b4ab0a\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.5.6 - 28-02-2022 *\/\n.elementor-heading-title{padding:0;margin:0;line-height:1}.elementor-widget-heading .elementor-heading-title[class*=elementor-size-]>a{color:inherit;font-size:inherit;line-height:inherit}.elementor-widget-heading .elementor-heading-title.elementor-size-small{font-size:15px}.elementor-widget-heading .elementor-heading-title.elementor-size-medium{font-size:19px}.elementor-widget-heading .elementor-heading-title.elementor-size-large{font-size:29px}.elementor-widget-heading .elementor-heading-title.elementor-size-xl{font-size:39px}.elementor-widget-heading .elementor-heading-title.elementor-size-xxl{font-size:59px}<\/style><h2 class=\"elementor-heading-title elementor-size-default\"><span class=\"elementor-heading-title elementor-size-default elementor-inline-editing pen\" data-elementor-setting-key=\"title\" data-pen-placeholder=\"\u5728\u6b64\u8f93\u5165...\" style=\"text-rendering: optimizeLegibility;\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2024-2025 Fall Semester<\/span><\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-1945d84 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"1945d84\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-60aa97e\" data-id=\"60aa97e\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-02125a4 elementor-widget elementor-widget-toggle\" data-id=\"02125a4\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.5.6 - 28-02-2022 *\/\n.elementor-toggle{text-align:left}.elementor-toggle .elementor-tab-title{font-weight:700;line-height:1;margin:0;padding:15px;border-bottom:1px solid #d4d4d4;cursor:pointer;outline:none}.elementor-toggle .elementor-tab-title .elementor-toggle-icon{display:inline-block;width:1em}.elementor-toggle .elementor-tab-title .elementor-toggle-icon svg{-webkit-margin-start:-5px;margin-inline-start:-5px;width:1em;height:1em}.elementor-toggle .elementor-tab-title .elementor-toggle-icon.elementor-toggle-icon-right{float:right;text-align:right}.elementor-toggle .elementor-tab-title .elementor-toggle-icon.elementor-toggle-icon-left{float:left;text-align:left}.elementor-toggle .elementor-tab-title .elementor-toggle-icon .elementor-toggle-icon-closed{display:block}.elementor-toggle .elementor-tab-title .elementor-toggle-icon .elementor-toggle-icon-opened{display:none}.elementor-toggle .elementor-tab-title.elementor-active{border-bottom:none}.elementor-toggle .elementor-tab-title.elementor-active .elementor-toggle-icon-closed{display:none}.elementor-toggle .elementor-tab-title.elementor-active .elementor-toggle-icon-opened{display:block}.elementor-toggle .elementor-tab-content{padding:15px;border-bottom:1px solid #d4d4d4;display:none}@media (max-width:767px){.elementor-toggle .elementor-tab-title{padding:12px}.elementor-toggle .elementor-tab-content{padding:12px 10px}}<\/style>\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2171\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-2171\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Sep 04 16:00-17:00 Thomas Studer (University of Bern) Non-wellfounded and cyclic proofs<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2171\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2171\"><p><strong>Abstract:<\/strong><\/p><p>Non-wellfounded and cyclic proofs provide a formal counterpart to proofs by infinite descent. So, proofs of this kind are helpful for logics dealing with inductive (and coinductive) definitions. This includes systems of arithmetic (induction over the natural numbers) and modal logics with fixed points (common knowledge and temporal operators). In this talk, I will introduce non-wellfounded and cyclic proofs and study their proof-theoretic properties.<\/p><div class=\"wp-block-spacer\" aria-hidden=\"true\">\u00a0<\/div><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2172\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-2172\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Sep 12 16:00-17:30 \u5f90\u6e90 (\u5317\u4eac\u7406\u5de5\u5927\u5b66) \u4eba\u5de5\u667a\u80fd\u524d\u6cbf\u6280\u672f\u53ca\u5176\u793e\u4f1a\u5e94\u7528<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2172\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2172\"><p><strong>Abstract:<\/strong><\/p><p>\u5f53\u524d\uff0c\u4eba\u5de5\u667a\u80fd\u6280\u672f\u7684\u98de\u901f\u53d1\u5c55\u6df1\u523b\u7684\u5f71\u54cd\u7740\u793e\u4f1a\u53d8\u9769\uff0c\u5728\u8d4b\u80fd\u5343\u884c\u767e\u4e1a\u7684\u540c\u65f6\uff0c\u4e5f\u4e3a\u793e\u4f1a\u79d1\u5b66\u9886\u57df\u5e26\u6765\u4e86\u524d\u6240\u672a\u6709\u7684\u673a\u9047\u3002\u5c24\u5176\u662f\u4ee5\u5927\u6a21\u578b\u4e3a\u4ee3\u8868\u7684\u751f\u6210\u5f0f\u4eba\u5de5\u667a\u80fd\u5c55\u73b0\u51fa\u4e86\u5f3a\u5927\u7684\u80fd\u529b\uff0c\u8fd9\u4e9b\u6280\u672f\u4e0d\u4ec5\u5728\u793e\u4f1a\u79d1\u5b66\u7684\u7406\u8bba\u7814\u7a76\u4e2d\u5f00\u8f9f\u4e86\u65b0\u9886\u57df\uff0c\u8fd8\u4e3a\u89e3\u51b3\u590d\u6742\u793e\u4f1a\u95ee\u9898\u63d0\u4f9b\u4e86\u65b0\u7684\u5de5\u5177\u3002\u672c\u6b21\u62a5\u544a\uff0c\u5c06\u4ece\u4eba\u5de5\u667a\u80fd\u3001\u54f2\u5b66\u3001\u4f20\u64ad\u5b66\u7b49\u8de8\u5b66\u79d1\u89c6\u89d2\u6765\u63a2\u8ba8\u4eba\u5de5\u667a\u80fd\u524d\u6cbf\u6280\u672f\u3001\u884c\u4e1a\u6700\u65b0\u7684\u5178\u578b\u5e94\u7528\uff0c\u4ee5\u53ca\u5176\u4e2d\u5e26\u6765\u7684\u5b89\u5168\u548c\u4f26\u7406\u95ee\u9898\uff0c\u65e8\u5728\u5f15\u8d77\u5927\u5bb6\u7684\u8ba8\u8bba\uff0c\u542f\u53d1\u5bf9\u4e8e\u4eba\u5de5\u667a\u80fd\u524d\u6cbf\u6280\u672f\u5411\u524d\u7684\u60f3\u8c61\u529b\u548c\u5411\u540e\u7684\u53cd\u601d\u529b\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2173\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-2173\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Sep 28 (SAT) 16:00-17:30 Xuefeng Wen (\u6587\u5b66\u950b, Sun Yat-Sen University ) Conditionals, Modals, and Validity in Contexts<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2173\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2173\"><p><strong>Abstract:<\/strong><\/p><p>We provide a semantics for a language containing indicatives and epistemic modals, which are elusive in formal semantics. The main idea is to evaluate a formula at a world in a context. An indicative is true at a world in a context if its consequent is true at the world in the new context updated by its antecedent in the old context. An epistemic necessity is true at a world in a context if it is true at all worlds in the context. Armed with the semantics, we define a ternary notion of validity, by which an inference is not valid per se, but valid under a set of assumptions, which are used to specify the context. The ternary notion of validity is meant to give a unified solution to several puzzles concerning indicatives and epistemic modals.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2174\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-2174\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Oct 24 16:00-17:30 Natasha Dobrinen (University of Notre Dame) Big Ramsey degrees and logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2174\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2174\"><p><strong>Abstract:<\/strong><\/p><p>The Infinite Ramsey Theorem states that given positive integers m and r, given a coloring of all m-element subsets of the natural numbers into r colors, there is an infinite set of natural numbers such that all of its m-element subsets have the same color.\u00a0 Following Sierpinski\u2019s work in the 1930\u2019s on colorings of finite linear orders as subsets of the rationals, the area of big Ramsey degrees seeks to understand when and to what extent the Infinite Ramsey Theorem extends to infinite structures.\u00a0 This talk will introduce big Ramsey degrees, demonstrate known characterizations, and discuss methods from set theory and computability applied in their study.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2175\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-2175\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Oct 31 16:00-17:30 Johan van Benthem (Stanford&Tsinghua&University of Amsterdam) Connecting Different Logics: Translation and Tracking<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2175\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2175\"><p><strong>Abstract:<\/strong><\/p><p>Many members of the crowd of modern logical systems look very different qua syntax and semantics, but how much unity is there when we look \u2018under the hood\u2019 of their engines? I start with some significant examples of translation and other forms of reduction between logical systems, some obvious, some quite surprising. As a special interest item, I will discuss \u2018tracking\u2019 of dynamic updates in different logics, taking the case of logics for analyzing games as a running example.<\/p><p>Reference:<\/p><ul><li>J. van Benthem, \u2018Implicit and Explicit Stances in Logic\u2019,\u00a0<em>Journal of Philosophical Logic<\/em>, 2018,\u00a0https:\/\/pure.uva.nl\/ws\/files\/85565602\/Benthem2019Article_ImplicitAndExplicitStancesInLo.pdf<\/li><li>J. van Benthem, \u2018Tracking Information\u2019, in K. Bimb\u00f3, ed.,\u00a0<em>Michael Dunn on Information\u2013Based Logics<\/em>,\u00a0Springer, Dordrecht, 363\u2013389.<\/li><li>J. van Benthem, \u2018Game levels, Game logics, Translations, Tracking, and More\u2019, working paper, ILLC, University of Amsterdam.<\/li><\/ul><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2176\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-2176\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Nov 05 19:00-20:30 Lev Beklemishev (Russian Academy of Sciences) Periodic frames<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2176\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2176\"><p><strong>Abstract:<\/strong><\/p><p>Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for the completeness proof are highly non-constructive. The question of completeness of GLP w.r.t. natural scattered topologies on ordinals is dependent on large cardinal axioms of set theory and is still open. So far, we are lacking a useable class of models for which GLP is complete.<br \/>In this paper (joint work with Yunsong Wang) we define a natural class of countable general topological frames on ordinals for which GLP is sound and complete. The associated topologies have been introduced by Thomas Icard in 2011. In addition, we specify a suitable algebra of subsets of an ordinal closed under the boolean and topological derivative operations. These algebras are based on the notion of a periodic set of ordinals generalizing that of an ultimately periodic omega-word.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2177\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-2177\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Nov 07 16:00-17:30 Hans van Ditmarsch (University of Toulouse) Distributed Knowledge Revisited<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2177\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2177\"><p>We review the history and some recent work on what is known since the 1990s as distributed knowledge. Such epistemic group notions are currently getting more and more attention both from the modal logical community and from distributed computing, in various settings with communicating processes or agents. The typical intuition is that if a knows p, and b knows that p implies q, then together they know that q: they have distributed knowledge of q. In order to get to know q they need to share their knowledge. We will discuss: (i) the complete axiomatization, (ii) why not everything that is distributed knowledge can become common knowledge, (iii) the notion of collective bisimulation, (iv) distributed knowledge for infinitely many agents, (v) the novel update called resolving distributed knowledge and some variations (and its incomparable update expressivity to action models), (vi) distributed knowledge that is stronger than the sum of individual knowledge (where the relation for the group of agents is strictly contained in their intersection), (vii) common distributed knowledge and its topological interpretations, (viii) dynamic distributed knowledge, a version of the semantics ensuring that what is distributed knowledge becomes common knowledge, and the axiomatization, expressivity and bisimulation characterization of this logic.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2178\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-2178\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Dec 05 15:15-16:45 Xiaolu Yang (\u6768\u5c0f\u7490, Tsinghua University) Early Linguistic Knowledge: Evidence from Experimental Studies of Language Perception and Comprehension in Mandarin-learning Toddlers<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2178\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2178\"><p>Early language acquisition research provides a unique perspective to understanding how children acquire language. One question concerns when children display specific abstract linguistic knowledge early in development. The other is how children break into a particular language (i.e. their mother tongue), assuming the availability of innate linguistic knowledge like Universal Grammar. In this talk, I will report some young children\u2019s perception and comprehension findings that attempt to provide answers to these important questions from a perspective of L1 acquisition of Mandarin Chinese. I will focus on Mandarin-learning toddlers\u2019 syntactic categorization, distinction of differing verb types and processing of function words, trying to show their early sensitivity to very subtle syntactic and semantic aspects of linguistic forms and structures.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-6a8c17f elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"6a8c17f\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-c4412e9\" data-id=\"c4412e9\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-8581a5f elementor-widget elementor-widget-heading\" data-id=\"8581a5f\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span class=\"elementor-heading-title elementor-size-default elementor-inline-editing pen\" data-elementor-setting-key=\"title\" data-pen-placeholder=\"\u5728\u6b64\u8f93\u5165...\" style=\"text-rendering: optimizeLegibility;\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2023-2024 Spring Semester<\/span><\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-72baf49 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"72baf49\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-d8c0d7d\" data-id=\"d8c0d7d\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-2140222 elementor-widget elementor-widget-toggle\" data-id=\"2140222\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-3481\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-3481\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Feb 29 16:00-17.30 Jun Zhang (University of Michigan Ann Arbor & Shanghai Institute for Mathematics and Interdisciplinary Sciences) Cognitive Core of Mathematical Reasoning: Some Thoughts<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3481\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3481\"><p><strong>Abstract:<\/strong><\/p><p>My talk will explore a common foundation for mathematical reasoning and for their underlying cognitive processes. Starting from counting and spatial reasoning as two core developmental domains of mathematical cognition, I will discuss how the notion of object can be characterized by \u201cconcept lattice\u201d (as in Formal Concept Analysis of Ganter and Wille 1999), and how the structure of knowledge can be captured by \u201cknowledge space\u201d (and its learning space, by Doignon and Falmagne 2015). Finally, motivated by the intertwined relations among lattice, logic, and topology, I will describe how the suite of topological operators, and hence topological semantics, can be generalized to general set systems (Lei and Zhang 2019), paving the way for using the latter as the common core for mathematical\/formal cognitive systems.<\/p><div class=\"wp-block-spacer\" aria-hidden=\"true\">\u00a0<\/div><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-3482\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-3482\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Mar 14 16:00-17.30 Byeong-Uk Yi (University of Toronto) Is Logic Axiomatizable?<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3482\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3482\"><p><strong>Abstract:<\/strong><\/p><p>I defend the negative answer to the question in the title, \u201cIs logic aziomatizable?\u201d, by considering sentences that involve plural constructions, such as the following:<br \/>[A] There are some things each of which admires one of them.<br \/>[B] There are some critics who admire only one another.<br \/>We can intuitively see that [A], for example, is logically implied by infinitely many sentences, such as the following:<br \/>[A1] c1 admires c2.<br \/>[A2] c2 admires c3.<br \/>\u2026<br \/>[An] cn admires cn+1.<br \/>\u2026<br \/>But [A] is not logically implied by any finite number of sentences among these. So the logic of languages that are rich enough to include [A] is non-compact. It follows from this that the logic of such languages is not axiomatizable. Similarly, we can see that [B], known as the Geach-Kaplan sentence, is logically implied by the following sentences (but not by any finite number of them):<br \/>[A1] c1 admires only c2, c1 is not c2, and c1 is a critic.<br \/>[A2] c2 admires only c3, c2 is not c3, and c2 is a critic.<br \/>\u2026<br \/>[An] cn admires only cn+1, cn is not cn+1, and cn is a critic.<br \/>\u2026<br \/>So we can conclude that the logic of languages that include [B] is not axiomatizable.<\/p><p>To put the argument in proper perspective, I shall discuss contemporary account of plural constructions and suggest that they fail to do justice to the logic of plural constructions because they are based on the traditional view of plural constructions as devices for abbreviating singular constructions. And I shall give a sketch of my account of the logic of plural constructions that are based on the view of plurals as substantial devices that complement their singular cousins.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-3483\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-3483\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Mar 21 16:00-17:30 \u8d3a\u98de\uff08\u6e05\u534e\u5927\u5b66\uff09 \u9762\u5411\u5e76\u53d1\u7a0b\u5e8f\u7684\u903b\u8f91\u7406\u8bba\u53ca\u5176\u81ea\u52a8\u5224\u5b9a\u5de5\u5177<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3483\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3483\"><p><strong>Abstract:<\/strong><\/p><p>\u903b\u8f91\u662f\u523b\u753b\u7a0b\u5e8f\u8bed\u4e49\u7684\u57fa\u7840\u3002\u53ef\u6ee1\u8db3\u6027\u6a21\u7406\u8bba\uff08SMT\uff09\u6c42\u89e3\u5668\u662f\u8bb8\u591a\u7a0b\u5e8f\u5206\u6790\u4e0e\u9a8c\u8bc1\u6280\u672f\u7684\u63a8\u7406\u5f15\u64ce\u3002\u76ee\u524d\uff0c\u5b58\u5728\u591a\u79cd\u4e00\u9636\u7406\u8bba\uff0c\u4f8b\u5982\u7ebf\u6027\u7b97\u672f\u7406\u8bba\u3001\u6570\u7ec4\u7406\u8bba\u3001\u4f4d\u5411\u91cf\u7406\u8bba\u3001\u672a\u89e3\u91ca\u51fd\u6570\u7406\u8bba\u7b49\uff0c\u57fa\u4e8e\u8fd9\u4e9b\u7406\u8bba\u5df2\u7ecf\u80fd\u591f\u5f88\u597d\u7684\u652f\u6301\u4e32\u884c\u7a0b\u5e8f\u9a8c\u8bc1\u3002\u7136\u800c\uff0c\u5374\u7f3a\u4e4f\u76f4\u63a5\u9762\u5411\u5e76\u53d1\u7a0b\u5e8f\u9a8c\u8bc1\u7684\u4e00\u9636\u7406\u8bba\u3002\u672c\u62a5\u544a\u4ecb\u7ecd\u6211\u4eec\u5728\u5e76\u53d1\u7a0b\u5e8f\u903b\u8f91\u7406\u8bba\u65b9\u9762\u53d6\u5f97\u7684\u6700\u65b0\u7814\u7a76\u6210\u679c\uff0c\u5e76\u4ecb\u7ecd\u76f8\u5e94\u7684\u81ea\u52a8\u5224\u5b9a\u7b97\u6cd5\u548c\u7a0b\u5e8f\u9a8c\u8bc1\u5de5\u5177\u3002\u57fa\u4e8e\u8be5\u7406\u8bba\u5f00\u53d1\u7684\u5e76\u53d1\u7a0b\u5e8f\u9a8c\u8bc1\u5de5\u5177Deagle\u8fde\u7eed\u4e09\u5e74\u83b7\u5f97\u56fd\u9645\u8f6f\u4ef6\u9a8c\u8bc1\u5927\u8d5b\u5e76\u53d1\u5b89\u5168\u8d5b\u9053\u51a0\u519b\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-3484\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-3484\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Mar 28 16:00-17:30 Wesley H. Holliday (University of California, Berkeley) Preconditionals<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3484\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3484\"><p><strong>Abstract:<\/strong><\/p><p>Conditionals in their different flavors\u2014material, strict, indicative, counterfactual, probabilistic, constructive, quantum, etc.\u2014have long been of central interest in philosophical logic. In this talk, we will discuss our recent work on a new semantics for conditionals, covering a large class of what we call preconditionals. Familiar examples of bounded lattices equipped with a preconditional include Heyting algebras, ortholattices with the Sasaki hook, and Lewis-Stalnaker-style conditional algebras satisfying the so-called Flattening axiom. We have shown that every bounded lattice equipped with a preconditional can be represented using a relational structure (suitably topologized), yielding a single relational semantics for conditional logics normally treated by different semantics, as well as generalizing beyond those semantics. An associated paper is available at https:\/\/arxiv.org\/abs\/2402.02296.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-3485\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-3485\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 Apr 18 16:00-17:30 Changshui Zhang (Tsinghua University) \u5b66\u4e60\u4e0e\u63a8\u7406<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3485\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3485\"><p><strong>Abstract:<\/strong><\/p><p>\u63a8\u7406\u662f\u4f20\u7edf\u4eba\u5de5\u667a\u80fd\u4e2d\u7684\u91cd\u8981\u7814\u7a76\u65b9\u5411\uff0c\u53d6\u5f97\u4e86\u5f88\u591a\u6210\u679c\u3002\u673a\u5668\u5b66\u4e60\u662f\u5f53\u524d\u4eba\u5de5\u667a\u80fd\u7814\u7a76\u7684\u91cd\u8981\u65b9\u5411\uff0c\u7279\u522b\u662f\u6df1\u5ea6\u5b66\u4e60\u65b9\u6cd5\u5c55\u73b0\u51fa\u5f3a\u5927\u7684\u5b66\u4e60\u80fd\u529b\u3002\u5728\u8fd9\u4e2a\u62a5\u544a\u4e2d\uff0c\u6211\u4eec\u4ece\u4e00\u4e9b\u5b9e\u9645\u5e94\u7528\u95ee\u9898\u5f00\u59cb\uff0c\u8ba8\u8bba\u5b66\u4e60\u548c\u63a8\u7406\u7ed3\u5408\u7684\u5b9e\u9645\u9700\u6c42\uff0c\u63a2\u8ba8\u8fd9\u4e00\u7814\u7a76\u65b9\u5411\u7684\u4e0d\u540c\u89e3\u51b3\u601d\u8def\u548c\u5173\u952e\u95ee\u9898\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-3486\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-3486\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2024 May 09 16:00-17:00 Su Gao (\u9ad8\u901f, Nankai University) Universal Structures in Continuous Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3486\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3486\"><p><strong>Abstract:<\/strong><\/p><p>Continuous logic is a nonstandard multi-valued logic developed in recent years to study metric structures. In this talk we consider the question whether universal structures with the Urysohn property exist in continuous logic. It turns out that the answer depends on some particular properties of the continuous signatures. In this talk I will give conditions that will completely characterize the existence of Urysohn structures and some other related properties in continuous logic. This is joint work with Xuanzhi Ren.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-681108c elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"681108c\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-7cad0d3\" data-id=\"7cad0d3\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-aefb37d elementor-widget elementor-widget-heading\" data-id=\"aefb37d\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span class=\"elementor-heading-title elementor-size-default elementor-inline-editing pen\" data-elementor-setting-key=\"title\" data-pen-placeholder=\"\u5728\u6b64\u8f93\u5165...\" style=\"text-rendering: optimizeLegibility;\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2023-2024 Fall Semester<\/span><\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-98c17b6 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"98c17b6\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-e82fee1\" data-id=\"e82fee1\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-e54310a elementor-widget elementor-widget-toggle\" data-id=\"e54310a\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2401\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-2401\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Oct 26 16:00~17:30 Veneeta Dayal (Yale University) The Interrogative Left Periphery and the Making of a Question<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2401\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2401\"><p><strong>Abstract:<\/strong><\/p><p>Questions are a quintessential interface phenomenon. Many (most?) languages use syntactic cues to separate declaratives and interrogatives; all languages distinguish interrogatives from declaratives semantically; all languages impose pragmatic requirements for the felicitous use of questions (calibrated to the type of question involved); most languages indicate questions vs. assertions prosodically, even if it may be hard to correlate each question type with a unique prosodic profile. These aspects of questions are clearly present in matrix questions but to what extent they are also present in embedded questions depends on the type of embedding involved: quoted interrogatives, quasi-subordinated interrogatives, fully subordinated interrogatives. I probe the interfaces between syntax, semantics, pragmatics and prosody in matrix as well as embedded questions, approaching the issue through the perspective of a three step process of question formation at the left periphery of the interrogative clause.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2402\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-2402\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Nov 30th 16:00~17:30 R Ramanujam (Institute of Mathematical Sciences, India) Looking for logic in social algorithms<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2402\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2402\"><p><strong>Abstract:<\/strong><\/p><p>There are many algorithms implicit or explicit in the way society works: for example, an election, or vaccine distribution policy. These algorithms rely on logical properties of underlying physical and social structures. For instance, in an election, we not only want confidentiality but also verifiability (that every vote cast has been counted), and many more such properties. Can we prove that these requirements are even consistent (something that we take for granted)?<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2403\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-2403\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Dec 14th 16:00~17:30 Xiaoshi Hu (\u80e1\u7b11\u9002, Tsinghua University) Event reading and nominal structures<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2403\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2403\"><p><strong>Abstract:<\/strong><\/p><p>This study focuses on the so-called pseudo-possessive construction in Chinese, which typically refers to such sentences as Ta-de(his) laoshi(teacher) dang-de(act-De) hao(well) \u2018He acts well as a teacher\u2019. In this kind of construction, within the subject of the verb, ta-de laoshi \u2018his teacher\u2019, the possessor and the possessee never form a possessive reading. Rather, they perform as subject and object respectively. Many analyses are proposed to explain such a syntax-semantics mismatch. For instance, in the formal syntactic framework, previous studies attribute the pseudo-possessive reading to a syntactic reanalysis or a verb movement. However, the present study argues against these syntactic derivational approaches, and proposes that possessive construction can itself encode an event reading. In other words, the ability of encoding events is the intrinsic property of nominal structure, which does not need the assistance of verbs. In the possessive construction, the possessor is in fact an argument of a nominal predicate. Furthermore, the pseudo-possessive construction in Chinese is attributed to the following three factors: the subject of the V-de construction encodes an event, the predicate following V-de describes the property of the event subject, the verb affixed by -de is the externalization of the way in which the subject satisfies the predicate.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2404\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-2404\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Dec 21st 16:00~17:30 Fei Liang (\u6881\u98de, Shandong University) On the Finite Model Property of Two Fragments of Intuitionistic Tense Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2404\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2404\"><p><strong>Abstract:<\/strong><\/p><p>Intuitionistic tense logic (IK.t), in the sense of W. B. Ewald, is obtained by adding two pairs of adjoint tense operators (F, H) and (P, G) to intuitionistic logic. It can be seen as a counterpart of classical tense logic in the setting of intuitionistic logic. The decidability of IK.t is still open. In this talk, I will consider the natural algebraic semantics of the disjunction-free fragment of IK.t and the {\\wedge,\\vee,\\neg,F,H,P,G,0}-reduct of IK.t firstly, and then introduce cut-free Gentzen calculi for these two fragments. Finally, using methods from algebraic proof theory, I will show that both of these two fragments have the FMP and whence they are decidable. This work is joint with Zhe Lin.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2405\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-2405\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Dec 28st 16:00~17:30 Yanjing Wang (\u738b\u5f66\u6676, Peking University) Bimodal Neighborhood Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2405\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2405\"><p><strong>Abstract:<\/strong><\/p><p>In this talk, we study a bimodal logic over neighborhood structures with two normal unary modalities. As first proposed by Zhao (2021), the language is defined via a simultaneous induction of two types of formulas, point-formulas and set-formulas, to be evaluated on possible worlds and sets of worlds respectively. We show that the bimodal language is equally expressive as the language of instantial neighborhood logic proposed by van Benthem et al. (2017). As the main result, we give a sound and strongly complete Hilbert axiomatization featuring two intertwined normal K-like systems with \u201cbridging rules\u201d, where a proof for a point-formula can be a mixed sequence of both point- and set-formulas. As a corollary, we show that the instantial neighborhood logic is compact, thus solving an open problem in the literature.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-66755c8 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"66755c8\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-3545d33\" data-id=\"3545d33\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-fb37004 elementor-widget elementor-widget-heading\" data-id=\"fb37004\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span class=\"elementor-heading-title elementor-size-default elementor-inline-editing pen\" data-elementor-setting-key=\"title\" data-pen-placeholder=\"\u5728\u6b64\u8f93\u5165...\" style=\"text-rendering: optimizeLegibility;\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2022-2023 Spring Semester<\/span><\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-a5e932b elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"a5e932b\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-d424a42\" data-id=\"d424a42\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-8524fb1 elementor-widget elementor-widget-toggle\" data-id=\"8524fb1\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1391\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-1391\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Feb 23rd 19:00~20:30 Sonja Smets (University of Amsterdam) Learning what Others Know<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1391\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1391\"><p><strong>Abstract:<\/strong><\/p><p>I will present joint work with A. Baltag on modelling scenarios in which agents read or communicate (or somehow gain access to) all the information stored at specific sources, or possessed by some other agents (including information of a non-propositional nature, such as data, passwords etc). Modelling such scenarios requires us to extend the framework of epistemic logics to one in which we abstract away from the specific announcement and formalize directly the action of sharing \u2018all you know\u2019 (with some or all of the other agents). In order to do this, we introduce a general framework for such informational events, that subsumes actions such as \u2018sharing all you know\u2019 with a group or individual, giving one access to some folder or database, hacking a database without the owner\u2019s knowledge, etc. We formalize their effect, i.e. the state of affairs in which one agent (or group of agents) has \u2018epistemic superiority\u2019 over another agent (or group). Concretely, we express epistemic superiority using comparative epistemic assertions between individuals and groups (as such extending the comparison-types considered in [5]). Another ingredient is a new modal operator for \u2018common distributed knowledge\u2019, that combines features of both common knowledge and distributed knowledge, and characterizes situations in which common knowledge can be gained in a larger group of agents (formed of a number of subgroups) by communication only within each of the subgroups. We position this work in the context of other known work such as: the problem of converting distributed knowledge into common knowledge via acts of sharing [4]; the more semantic approach in [2] on communication protocols requiring agents to \u2018tell everybody all they know\u2019; the work on public sharing events with a version of common distributed knowledge in [3]; and the work on resolution actions in [6].<\/p><p>[1] A. Baltag and S. Smets, Learning what others know, in L. Kovacs and E. Albert (eds.), LPAR23 proceedings of the International Conference on Logic for Programming, AI and Reasoning, EPiC Series in Computing, 73:90-110, 2020. https:\/\/doi.org\/10.29007\/plm4<br \/>[2] A. Baltag and S. Smets, Protocols for Belief Merge: Reaching Agreement via Communication, Logic Journal of the IGPL, 21(3):468-487, 2013. https:\/\/doi.org\/10.1093\/jigpal\/jzs049<br \/>[3] A. Baltag, What is DEL good for? Lecture at the ESSLLI2010-Workshop on Logic, Rationality and Intelligent Interaction, 16 August 2010.<br \/>[4] J. van Benthem, One is a lonely number. In P. Koepke Z. Chatzidakis and W. Pohlers, (eds.) Logic Colloquium 2002, 96-129, ASL and A.K. Peters, Wellesley MA, 2002.<br \/>[5] H. van Ditmarsch, W. van der Hoek &amp; B. Kooi, Knowing More \u2013 from Global to Local Correspondence, Proc. of IJCAI-09, 955\u2013960, 2009.<br \/>[6] T. Agotnes and Y.N. Wang, Resolving Distributed Knowledge, Artificial Intelligence, 252: 1\u201321, 2017. https:\/\/doi.org\/10.1016\/j.artint.2017.07.002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1392\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-1392\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Mar 02nd 16:00~17:30 Dun Deng (\u9093\u76fe\uff0cTsinghua University) Internal antisymmetry of Chinese disyllabic coordinative verbs and its theoretical implications<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1392\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1392\"><p><strong>Abstract:<\/strong><\/p><p>In this talk, I will first demonstrate the internal antisymmetry of Chinese disyllabic coordinative verbs (CDCVs) such as \\zhi-zao\/ \u2018manufacture\u2019 and \\xiu-li\/ \u2018repair\u2019. Using a sample of 400 CDCVs and a carefully designed annotation scheme to analyze all the CDCVs, we find that for each of the 400 CDCVs, one of the two root morphemes inside the compound verb can be identified as the more prominent one (call it H), which plays a more important role than the other root morpheme in determining the argument structure of the compound verb. This means that the 400 CDCVs have an asymmetrical internal structure with its two root morphemes being unequal in function. By studying the properties of all the Hs, we find strategies employed by the grammar to decide H, and provide an account for the strategies. Relying on our empirical findings about the internal antisymmetry of CDCVs, I then discuss and try to explain two theoretical issues. The first is about a well-known generalization in Chinese linguistics, namely that disyllabic verbs exhibit nominal behavior which corresponding monosyllabic verbs lack. The other is about the peculiar fact that CDCVs exist in large amount in Chinese whereas other languages like English rarely have equivalents.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1393\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-1393\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Mar 09 16:00~17:30 Fan Yang \u6768\u5e06 (Utrecht University) Dependence logic and its axiomatization problem<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1393\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1393\"><p><strong>Abstract:<\/strong><\/p><p>Dependence logic was introduced by V\u00e4\u00e4n\u00e4nen (2007) as a novel formalism for reasoning about dependence and independence relations. The logic adopts the team semantics of Hodges (1997). The basic idea of team semantics is that dependency properties can only manifest themselves in multitudes, and thus formulas of dependence logic are evaluated on sets of assignments (called teams) instead of single assignment as in the usual Tarskian semantics. A team can be naturally viewed as a relational database, a dataset, an information state, etc. Thanks to the simple structure of teams and the abundance of their interpretations in various fields of science, team semantics and dependence logic have recently found a number of applications in addressing issues in database theory, formal linguistics, quantum foundations, social choice and so on. In the first part of this talk, I will provide an overview of the core theory and applications of dependence logic. Teams are essentially relations, which are second-order objects. Dependence logic is known to be equivalent to existential second-order logic, and thus cannot be effectively axiomatized in full. In the second part of the talk, I will survey some recent developments in finding partial axiomatizations for dependence logic.<\/p><p>Speaker\u2019s homepage: https:\/\/sites.google.com\/site\/fanyanghp\/<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1394\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-1394\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Mar 16 16:00~17:30 Feng Ye \u53f6\u5cf0 (Capital Normal University) Introducing Studies in No-Self Physicalism<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1394\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1394\"><p><strong>Abstract:<\/strong><\/p><p>This talk will introduce my recent book\u00a0<em>Studies in No-Self Physicalism<\/em>. I will first explain the basic ideas of \u2018no-Self\u2019 physicalism. This introduces the basic assumptions and overall goal of the researches presented in this book and introduces chapters 1 and 2 of the book. Chapters 3 to 8 of the book develop a series of philosophical theories under the framework of No-Self Physicalism. They include theories on concept and conceptual representation (Chapter 3), thought, truth, analyticity, belief ascription, and modality (Chapter 4), philosophy of mathematics (Chapter 5), epistemic justification, knowledge, apriority, and intuition (Chapter 6), physicalistic ontology (Chapter 7), and coherent formulation of physicalism (Chapter 8). This talk will also very briefly introduce some of the ideas in these chapters.<br \/>Speaker\u2019s homepage \u2013 http:\/\/cnu-cn.academia.edu\/FengYe<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1395\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-1395\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Mar 23 16:00~17:30 Xinwen Liu \u5218\u65b0\u6587 (Chinese Academy of Social Sciences) \u91d1\u5cb3\u9716\u5bf9\u201c\u5218\u6613\u65af-\u6d77\u5fb7\u683c\u5c14\u201d\u95ee\u9898\u7684\u56de\u7b54<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1395\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1395\"><p><strong>Abstract:<\/strong><\/p><p>\u91d1\u5cb3\u9716\u7cfb\u7edf\u5730\u5206\u6790\u4e86\u771f\u4e4b\u7b26\u5408\u8bba\u4e2d\u7684\u201c\u7b26\u5408\u201d\uff0c\u8ba4\u4e3a\u201c\u7b26\u5408\u662f\u2018\u771f\u2019\u5e95\u6240\u8c13\u201d\uff0c\u878d\u6d3d\u3001\u6709\u6548\u548c\u4e00\u81f4\u662f\u7ecf\u9a8c\u5230\u7b26\u5408\u7684\u6807\u51c6\uff0c\u5b83\u4eec\u90fd\u662f\u771f\u4e4b\u6807\u51c6\u3002\u5728\u91d1\u5cb3\u9716\u7684\u7406\u8bba\u4e2d\uff0c\u7b26\u5408\u8bba\u6700\u4e3a\u5173\u952e\u7684\u6210\u5206\u201c\u7b26\u5408\u76f4\u89c2\u201d\u88ab\u89e3\u91ca\u4e3a\u7b26\u5408\u611f\u3002\u7b26\u5408\u611f\u5728\u6a2a\u7684\u65f6\u95f4\u4e0a\u5c31\u662f\u7b26\u5408\uff0c\u4f46\u5c31\u7eb5\u7684\u65f6\u95f4\u8bf4\uff0c\u7b26\u5408\u611f\u4e0e\u7b26\u5408\u4e0d\u5fc5\u5408\u4e00\uff0c\u5373\u5224\u65ad\u7684\u5bf9\u4e0e\u547d\u9898\u7684\u771f\u4e0d\u5fc5\u5408\u4e00\u3002\u91d1\u5cb3\u9716\u5173\u4e8e\u201c\u7b26\u5408\u201d\u7684\u5206\u6790\u56de\u5e94\u4e86\u7b26\u5408\u8bba\u7684\u6838\u5fc3\u95ee\u9898\u201c\u7b26\u5408\u662f\u4ec0\u4e48\u201d\uff0c\u8fd9\u4e2a\u95ee\u9898\u5728\u5f53\u524d\u6587\u732e\u4e2d\u4e5f\u88ab\u79f0\u4e3a\u201c\u5218\u6613\u65af\u2014\u6d77\u5fb7\u683c\u5c14\u95ee\u9898\u201d\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1396\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-1396\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Mar 30 16:00~17:30 Frederik van der Putte (Ghent University): The problem of no hands : responsibility voids in collective decisions<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1396\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1396\"><p>The problem of no hands concerns the existence of so-called responsibility voids: cases where a group makes a certain decision, yet no individual member of the group can be held responsible for this decision. Criteria-based collective decision procedures play a central role in philosophical debates on responsibility voids. In particular, the well-known discursive dilemma has been used to argue for the existence of these voids. But there is no consensus: others argue that no such voids exist in the discursive dilemma under the assumption that casting an untruthful opinion is eligible. We argue that, under this assumption, the procedure used in the discursive dilemma is indeed immune to responsibility voids, yet such voids can still arise for other criteria-based procedures. We provide two general characterizations of the conditions under which criteria-based collective decision procedures are immune to these voids. Our general characterizations are used to prove that responsibility voids are ruled out by criteria-based procedures involving an atomistic or monotonic decision function. In addition, we show that our results imply various other insights concerning the logic of responsibility voids.<\/p><p>Reference available at https:\/\/biblio.ugent.be\/publication\/8735886<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1397\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-1397\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Apr 06 16:00~17:30 Fengkui Ju \u741a\u51e4\u9b41 (Beijing Normal University): Logic for strategic reasoning in dynamic strategy contexts<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1397\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1397\"><p><strong>Abstract:<\/strong><\/p><p>Strategic reasoning is usually performed in specific strategy contexts, concerning which strategies are in consideration. Strategic reasoning can involve the change of strategy contexts. In this talk, we present a logic for strategic reasoning involving the change of strategy contexts caused by commitments to strategies. The logic has two featured formulas: (1) for some strategy of an agent compatible with the strategy context, if the agent commits to it, a formula is guaranteed to be true; (2) for every strategy of an agent compatible with the strategy context, if the agent commits to it, a formula is guaranteed to be true. Commitments to strategies shrink strategy contexts, which are defined as sets of sets of individual strategies.<\/p><p>This talk is based on a joint work with Valentin Goranko from Stockholm University.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1398\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-1398\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Apr 20 16:00~17:30 Shengyang Zhong \u949f\u76db\u9633(Peking University\uff09: Quantum Measurement and Quantum Entanglement \u2013 From the Perspective of the Orthogonality Relation<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1398\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1398\"><p><strong>Abstract:<\/strong><\/p><p>This talk is a survey of a project of my research since around 2014. First, I will introduce the aim, the paradigm and the approaches in mathematical foundations of quantum theory which form the background of this talk. Second, I will introduce a toy model of the kind of mathematical structure which I use to model the states of a quantum system and the orthogonality relation between them. Third, I will discuss the way to describe quantum measurement and quantum entanglement only in terms of the orthogonality relation. We will see that such a simple description highlights some essentials and provides some insights.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-1399\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-1399\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 May 13th 09:00~10:30 Wesley Holliday (University of California, Berkeley): The Orthologic of Epistemic Modals<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1399\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1399\"><p><strong>Abstract:<\/strong><\/p><p>The epistemic modals \u2018might\u2019 and \u2018must\u2019 have peculiar logical features that are challenging to account for in a broadly classical framework. In this talk, I will discuss a non-classical approach to epistemic modals from my paper with Matthew Mandelkern, \u201cThe Orthologic of Epistemic Modals\u201d (https:\/\/escholarship.org\/uc\/item\/0ss5z8g3), with special attention to the new Section 5 (\u201cConstructing possibilities from worlds\u201d).<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-13910\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-13910\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 May 18th 14:00~15:30 Sujata Ghosh (Indian Statistical Institute, Chennai (ISI, Chennai)): A modal logic to reason in distributed games<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-13910\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-13910\"><p>In distributed games, every player sees only the local game arena, and announces potential joint moves with other players. The global arena resolves these and the game proceeds. We propose a two-level logic to reason in such games, with one layer of local formulas for each player, and the global formulas. We present a complete axiom system for valid formulas and show decidability.<\/p><p>This talk is based on joint work with Lei Li, Fenrong Liu and R. Ramanujam.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-13911\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-13911\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 May 25th 16:00~17:30 Marta Bilkova (Czech Academy of Sciences): Belnapian logics for uncertainty<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-13911\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-13911\"><p><strong>Abstract\uff1a<\/strong><\/p><p>Reasoning about information, its potential incompleteness, uncertainty,\u00a0and contradictoriness need to be dealt with adequately. While\u00a0incompleteness and uncertainty are typically accommodated within one\u00a0formalism, e.g. within various models of imprecise probability,\u00a0contradictoriness and uncertainty less so \u2014 conflict or\u00a0contradictoriness of information is rather chosen to be resolved than to\u00a0be reasoned with. To reason with conflicting information, positive and\u00a0negative support \u2014 evidence in favour and evidence against \u2014 a\u00a0statement are quantified separately in the semantics. This\u00a0two-dimensionality gives rise to logics interpreted over twist-product\u00a0algebras or bi-lattices, the well known Belnap-Dunn logic of First\u00a0Degree Entailment being a prominent example. Belnap-Dunn logic with its\u00a0double-valuation frame semantics can in turn be taken as a base logic\u00a0for defining various uncertainty measures on de Morgan algebras, e.g.\u00a0Belnapian (non-standard) probabilities or belief functions.<\/p><p>In spirit similar to Belnap-Dunn logic, we have introduced many-valued\u00a0logics suitable to reason about such uncertainty measures. They are\u00a0interpreted over twist-product algebras based on the [0,1] real interval\u00a0as their standard semantics and can be seen to account for the\u00a0two-dimensionality of positive and negative component of (the degree of)\u00a0belief or likelihood based on potentially contradictory information,\u00a0quantified by an uncertainty measure. The logics presented in this talk\u00a0include expansions of \u0141ukasiewicz with a de-Morgan negation which swaps\u00a0between the positive and negative semantical component.<\/p><p>Our main objective is to utilise apparatus of two-layered logics to\u00a0formalise reasoning with uncertain information, which itself might be\u00a0non-classical, i.e., incomplete or contradictory. Many-valued logics\u00a0with a two-dimensional semantics mentioned above are used on the outer\u00a0layer to reason about belief, likelihood or certainty based on\u00a0potentially incomplete or contradictory evidence, building on\u00a0Belnap-Dunn logic as an inner logic of the underlying evidence. This\u00a0results in two-layered logics suitable for reasoning scenarios when\u00a0aggregated evidence yields a Belnapian probability measure or a belief\u00a0function on a De Morgan algebra.<br \/>(This talk is rooted in joint work with S. Frittella, D. Kozhemiachenko,\u00a0O. Majer and S. Nazari.)<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-13912\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-13912\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Jun 01st 16:00~17:30 Yan Zhang (\u5f20\u708e, Renmin University of China): Transitive Logics of Finite Depth and Finite Suc-eq-width<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-13912\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-13912\"><p><strong>Abstract:<\/strong><\/p><p>In this talk, I will present some results from the study of transitive logics of finite depth and finite suc-eq-width. They are logics in NExtK4 containing the standard depth axioms and the suc-eq-width axioms, which are generalizations of the standard width axioms. The frame condition for a suc-eq-width axiom requires, in a rooted transitive frame, a finite upper bound of cardinality for antichains of points with different sets of proper successors. Our first result demonstrates that all these logics are finitely axiomatizable, thereby generalizing Rybakov and Chagrov\u2019s result of the finite axiomatizability of extensions of S4 of finite depth and finite width. Applying the well-known result from Segerberg that all transitive logics of finite depth have the finite model property, we then establish that all transitive logics of finite depth and finite suc-eq-width are decidable. Lastly, the complexity of the satisfiability problem for these logics can be shown to fall within the NP class.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-13913\" class=\"elementor-tab-title\" data-tab=\"13\" role=\"tab\" aria-controls=\"elementor-tab-content-13913\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2023 Jun 08th 16:00~17:30 Hao TANG (\u5510\u6d69, Tsinghua University): Attention and Practical Knowledge<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-13913\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"13\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-13913\"><p>Practical knowledge, in the sense made famous by G. E. M. Anscombe, is \u201cthe knowledge that a man has of his intentional actions\u201d. This knowledge is very ordinary, but philosophically it is far from easy to understand. One illuminating approach to practical knowledge is to see it as a species of self-knowledge or self-consciousness. I offer an enrichment of this approach here, by exploiting Gilbert Ryle\u2019s discussion of heeding (that is, paying attention), in particular paying attention to one\u2019s own intentional action. I will argue, in a broadly Kantian spirit, that paying attention to what one is doing is an exercise of practical self-consciousness. It is how practical self-consciousness is \u201cschematized\u201d.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-bf8378b elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"bf8378b\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-762b557\" data-id=\"762b557\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-7c43468 elementor-widget elementor-widget-heading\" data-id=\"7c43468\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span class=\"elementor-heading-title elementor-size-default elementor-inline-editing pen\" data-elementor-setting-key=\"title\" data-pen-placeholder=\"\u5728\u6b64\u8f93\u5165...\" style=\"text-rendering: optimizeLegibility;\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2022-2023 Autumn Semester<\/span><\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-30e555e elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"30e555e\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-094a33a\" data-id=\"094a33a\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-cb3ab22 elementor-widget elementor-widget-toggle\" data-id=\"cb3ab22\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2131\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-2131\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Sep 15 16:00-17:30 Changpu Sun \u5b59\u660c\u749e (China Academy of Engineering Physics): \u91cf\u5b50\u529b\u5b66\u7684\u5ba2\u89c2\u6027\u8be0\u91ca\u4e0e\u6ce2\u666e\u5c14\u54f2\u5b66<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2131\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2131\"><p><strong>Abstract:<\/strong><\/p><p>\u91cf\u5b50\u529b\u5b66\u5960\u5b9a\u4e86\u73b0\u4ee3\u79d1\u5b66\u7684\u57fa\u7840\uff0c\u6210\u529f\u5730\u63a8\u52a8\u5f53\u4ee3\u6280\u672f\u9769\u547d\u65b9\u9762\u3002\u7136\u800c\uff0c\u5bf9\u4e8e\u91cf\u5b50\u529b\u5b66\u8be0\u91ca\u2014\u2014\u7406\u89e3\u6ce2\u51fd\u6570\u5982\u4f55\u8ff0\u523b\u753b\u5fae\u89c2\u4e16\u754c\uff0c\u8fc4\u4eca\u4e3a\u6b62\u4eba\u4eec\u5e76\u672a\u5f62\u6210\u5171\u8bc6\u3002\u672c\u62a5\u544a\u5c06\u7ed3\u5408\u62a5\u544a\u4eba\u4e8c\u5341\u4f59\u5e74\u5173\u4e8e\u91cf\u5b50\u529b\u5b66\u57fa\u7840\u95ee\u9898\u8270\u8f9b\u63a2\u7d22\uff0c\u7b80\u8981\u4ecb\u7ecd\u548c\u8bc4\u8ff0\u8fd9\u4e9b\u91cf\u5b50\u529b\u5b66\u8be0\u91ca\u7684\u57fa\u672c\u601d\u60f3\u3001\u5b83\u4eec\u4e4b\u95f4\u7684\u903b\u8f91\u5173\u7cfb\u53ca\u5176\u5b9e\u9a8c\u68c0\u9a8c\u7684\u53ef\u80fd\u6027\u3002\u62a5\u544a\u5f3a\u8c03\uff0c\u9996\u5148\u8981\u660e\u786e\u5b9a\u4e49\u4ec0\u4e48\u662f\u91cf\u5b50\u6d4b\u91cf\u3001\u4ec0\u4e48\u662f\u91cf\u5b50\u6d4b\u91cf\u7684\u5ba2\u89c2\u6027\uff0c\u624d\u80fd\u6f84\u6e05\u91cf\u5b50\u529b\u5b66\u8be0\u91ca\u4e2d\u7684\u4e00\u4e9b\u57fa\u672c\u6982\u5ff5\uff0c\u907f\u514d\u91cf\u5b50\u89c2\u5ff5\u6ee5\u7528\u5f15\u8d77\u7684\u610f\u8bc6\u8bba\u4e0a\u7684\u95ee\u9898\u3001\u4f7f\u5f97\u91cf\u5b50\u6280\u672f\u53d1\u5c55\u8bef\u5165\u6b67\u9014\u3002<\/p><p>\u62a5\u544a\u7740\u91cd\u9610\u8ff0\u4e86\u91cf\u5b50\u529b\u5b66\u5982\u4f55\u63cf\u8ff0\u5fae\u89c2\u4e16\u754c\u7684\u5ba2\u89c2\u5c5e\u6027\u3002\u6211\u4eec\u8ba4\u4e3a\uff0c\u7531\u4e8e\u91c7\u7528\u4e86\u4e0d\u5177\u552f\u4e00\u6027\u7684\u6ce2\u5305\u584c\u7f29\u5047\u8bbe\uff0c\u54e5\u672c\u54c8\u6839\u8be0\u91ca\u5bf9\u54f2\u5b66\u57fa\u672c\u95ee\u9898\u6784\u6210\u7684\u6311\u6218\u5e76\u975e\u6839\u672c\u6027\u7684\uff0c\u6709\u4eba\u7531\u6b64\u5f97\u5230\u7269\u8d28-\u610f\u8bc6\u4e0d\u53ef\u5206\u7684\u7ed3\u8bba\u5728\u79d1\u5b66\u548c\u54f2\u5b66\u90fd\u662f\u4e0d\u4e25\u8c28\u7684\u3002\u9488\u5bf9\u5361\u5c14\u00b7\u6ce2\u666e\u5c14\u201c\u4e09\u4e2a\u4e16\u754c\u201d\u54f2\u5b66\uff0c\u62a5\u544a\u57fa\u4e8e\u91cf\u5b50\u6d4b\u91cf \u7406\u8bba\u63cf\u8ff0\u4e86\u591a\u4e2a\u89c2\u5bdf\u8005\u5982\u4f55\u5bf9\u5fae\u89c2\u7cfb\u7edf\u8fdb\u884c\u63a2\u6d4b\uff0c\u5f62\u6210\u5ba2\u89c2\u7684\u91cf\u5b50\u6d4b\u91cf\uff0c\u4ea7\u751f\u5fae\u89c2\u4e16\u754c\u7684\u5ba2\u89c2\u77e5\u8bc6\uff0c\u4ece\u800c\u5bf9 \u6ce2\u666e\u5c14\u7684\u5ba2\u89c2\u77e5\u8bc6\u4e16\u754c(\u4e16\u754c 3)\u7ed9\u51fa\u4e86\u57fa\u4e8e\u91cf\u5b50\u529b\u5b66\u672c\u4f53\u8bba\u7684\u54f2\u5b66\u89e3\u8bfb:\u7269\u8d28\u4e16\u754c(\u4e16\u754c 1)\u4e0e\u7cbe\u795e\u611f\u77e5\u4e16 \u754c(\u4e16\u754c 2)\u7684\u7269\u5316\u8f7d\u4f53(\u8ba4\u8bc6\u4e3b\u4f53)\u76f8\u4e92\u4f5c\u7528\uff0c\u5f62\u6210\u4e8c\u8005\u7684\u5173\u8054\u548c\u7ea0\u7f20\uff0c\u5b83\u4eec\u5bf9\u5e94\u4e86\u4e3b\u89c2\u4e16\u754c\u5728\u5185\u7684\u7cbe\u795e \u611f\u77e5\u5168\u4f53\uff0c\u5176\u4e2d\u5177\u6709\u5ba2\u89c2\u6027\u7684\u90e8\u5206\u6784\u6210\u4e86\u5fae\u89c2\u4e16\u754c\u7684\u5ba2\u89c2\u77e5\u8bc6\u3002\u6587\u7ae0\u8fd8\u6307\u51fa\uff0c\u4f34\u968f\u7740\u5fae\u89c2\u7cfb\u7edf\u5ba2\u89c2\u77e5\u8bc6\u4e16\u754c \u7684\u5f62\u6210\uff0c\u4fe1\u606f\u4ece\u7269\u8d28\u4e16\u754c\u6d41\u5411\u4e3b\u89c2\u5ba2\u4f53\uff0c\u4fe1\u606f\u6d41\u7684\u6307\u5411\u5b9a\u4e49\u4e86\u4e0d\u540c\u4e8e\u901a\u5e38\u7269\u8d28\u4e16\u754c\u7684\u7cbe\u795e\u611f\u77e5\u7684\u7269\u5316\u8f7d\u4f53\u3002<\/p><div class=\"wp-block-spacer\" aria-hidden=\"true\">\u00a0<\/div><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2132\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-2132\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Sep 22 16:00-17:30 Zhaokuan Hao \u90dd\u5146\u5bbd (Fudan University): \u6982\u5ff5\u4e0e\u53ef\u5b9a\u4e49\u6027<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2132\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2132\"><p><strong>Abstract:<\/strong><\/p><p>1885 \u5e74\uff0c\u4e5f\u5c31\u662f\u5f17\u96f7\u683c\u7684 \u300a\u7b97\u672f\u57fa\u7840\u300b \u51fa\u7248\u4e00\u5e74\u540e\uff0c\u5eb7\u6258\u53d1\u8868\u4e86\u4ed6\u5bf9\u8fd9\u90e8\u8457\u4f5c\u7684\u8bc4\u8bba\u3002 \u8fd9\u7bc7\u8bc4\u8bba\u53ea\u6709\u4e00\u9875\uff0c\u4f46\u6d89\u53ca\u4e00\u4e2a\u975e\u5e38\u91cd\u8981\u4e5f\u975e\u5e38\u6709\u8da3\u7684\u95ee\u9898\uff0c\u90a3\u5c31\u662f\u6982\u5ff5\u5916\u5ef6\u548c\u96c6\u5408\u54ea\u4e00\u4e2a\u66f4\u4e3a\u57fa\u7840\u3002\u5728\u672c\u6b21\u6f14\u8bb2\u4e2d\uff0c\u6211\u4eec\u8bd5\u56fe\u8ba8\u8bba\u8fd9\u4e00\u5206\u6b67\u7684\u54f2\u5b66\u610f\u4e49\u6781\u5176\u6240\u4ee3\u8868\u7684\u4e0d\u540c\u4f20\u7edf\uff0c\u5e76\u4e14\u5c06\u53ef\u5b9a\u4e49\u6027\u89c6\u4e3a\u628a\u63e1\u5ba2\u89c2\u6982\u5ff5\u7684\u4e3b\u8981\u5de5\u5177\u3002\u6211\u4eec\u4f1a\u8bba\u8bc1\u5eb7\u6258\u7684\u8bc4\u8bba\u548c\u5f17\u96f7\u683c\u4e24\u4e2a\u6708\u540e\u7684\u56de\u5e94\u4e0d\u4ec5\u5177\u6709\u91cd\u5927\u7684\u5386\u53f2\u610f\u4e49\uff0c\u800c\u4e14\u4e0e\u5f53\u4eca\u6570\u5b66\u57fa\u7840\u7684\u4e00\u4e2a\u91cd\u5927\u95ee\u9898\u5bc6\u5207\u76f8\u5173\u3002 \u96c6\u5408\u8bba\u867d\u7136\u81ea\u5eb7\u6258\u5c14\u4ee5\u6765\u53d6\u5f97\u4e86\u5de8\u5927\u7684\u6210\u529f\uff0c\u4f46\u5176\u57fa\u7840\u6240\u9762\u4e34\u7684\u56f0\u96be\u53ef\u80fd\u4e0e\u5eb7\u6258\u5bf9\u6982\u5ff5\u7684\u8bef\u89e3\u6709\u5173\u3002\u8fd9\u4e9b\u56f0\u96be\u501f\u52a9\u5f17\u96f7\u683c\u548c\u54e5\u5fb7\u5c14\u7684\u6982\u5ff5\u8bba\u54f2\u5b66\u601d\u60f3\u6709\u53ef\u80fd\u627e\u5230\u6570\u5b66\u89e3\u51b3\u65b9\u6848\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2133\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-2133\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Sep 29 16:00-17:30 Heinrich Wansing (Ruhr University Bochum): Beyond Paraconsistency \u2013 A plea for a radical breach with the Aristotelean orthodoxy in logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2133\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2133\"><p><strong>Abstract:<\/strong><\/p><p>The development of systems of paraconsistent, inconsistency-tolerant logics in the 20th century can be seen as a major and bold move in the history of ideas. Ever since Aristotle\u2019s formulation of the law of non-contradiction, when he wrote in 1011b13\u201314 of what is now called Metaphysics IV that \u201copposite assertions cannot be true at the same time,\u201d negation consistency has been regarded as absolutely indispensable for theoretically rational theory formation. However, even the founders of paraconsistent, inconsistency-tolerant logic, Stanislaw Jaskowski and Newton da Costa, and the key proponent of dialetheism, Graham Priest, did not liberate themselves completely from the consistency bonds of classical logic and the most prominent non-classical logics in more than one way, especially in not accounting for logically provable (or, semantically, logically valid) contradictions and non-trivial negation inconsistent logics.<br \/>I will suggest to radically break with the time-honored Aristotelean tradition of complete banishment of contradictions in science. In particular, I will argued that it is theoretically rational to believe not only that there exist interesting or important non-trivial negation inconsistent theories but also that there exist interesting or important non-trivial negation inconsistent logics. I will present several examples of such logics.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2134\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-2134\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Oct 13 16:00-17:30 Sujata Ghosh (Indian Statistical Institute, Chennai): What drives people\u2019s choices in turn-taking games?<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2134\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2134\"><p><strong>Abstract:<\/strong><\/p><p>Game theorists have proposed backward induction as the reasoning procedure that rational players follow in turn-taking games. An alternative is forward induction, in which a player rationalizes any previous move by the opponent that does not fit backward induction. Do adult participants\u2019 choices in centipede-like turn-taking games fit better with backward or forward induction? In a couple of experiments, participants played a turn-taking game against a computer, which was programmed to deviate often from the backward induction strategy at the beginning of the game. Participants had been told that the computer was optimizing against some belief about the participant\u2019s future strategy. In the course of the experiments, participants were asked questions about their own and the opponent\u2019s reasoning at all decision nodes of a sample game. We checked how their verbalized strategies fit to their choices in the experimental games. Although in the aggregate, participants tend to favor the forward induction choice, their verbalized strategies usually involve explicit theory of mind, their own attitudes towards risk, and those they assign to the opponent, as well as considerations about cooperativeness.<\/p><p>This talk is based on joint work with Aviad Heifetz, Rineke Verbrugge and Harmen de Weerd.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2135\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-2135\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Oct 20 16:00-17:30 Andreas Herzig (Institut de Recherche en Informatique de Toulouse): On logics of knowledge and belief<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2135\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2135\"><p><strong>Abstract:<\/strong><\/p><p>Epistemic logics are traditionally about the modalities \u2018belief-that\u2019 and \u2018knowledge-that\u2019. The talk will instead focus on modalities of the \u2018knowledge-whether\u2019 kind, providing insights about the principles governing common knowledge and about the interplay between knowledge and belief. As \u2018belief whether\u2019 does not exist in natural language we use the term \u2018belief about\u2019 instead. Concerning common knowledge, we study the following principle for common knowledge: common knowledge that each agent knows whether p implies common knowledge whether p. If the logic of knowledge is S5 then it provides an equivalent and more intuitive alternative to the standard induction axiom for common knowledge. Concerning the interplay between knowledge and belief we follow, among others, Lenzen and Voorbraak and adopt S4.2 as the logic of knowledge and KD45 as the logic of (strong) belief, plus the interaction axioms \u2018knowledge implies belief\u2019, \u2018belief implies knowledge to believe\u2019, and \u2018belief implies belief to know\u2019. In this framework we study the two modalities \u2018true belief about\u2019 andmere \u2018belief about\u2019: they lead to an elegant characterisation of epistemic-doxastic situations as well as to the definition of interesting lightweight fragments of epistemic-doxastic logic.<\/p><p>References:<\/p><ul><li>Andreas Herzig, Elise Perrotin: True Belief and Mere Belief About a Proposition and the Classification of Epistemic-Doxastic Situations. Filosofiska Notiser, 103-117 (2021) http:\/\/filosofiskanotiser.com\/Herzig_Perrotin.pdf<\/li><li>Andreas Herzig, Elise Perrotin: On the Axiomatisation of Common Knowledge. AiML 2020: 309-328. http:\/\/www.aiml.net\/volumes\/volume13\/Herzig-Perrotin.pdf<\/li><li>Martin C. Cooper, Andreas Herzig, Faustine Maffre, Fr\u00e9d\u00e9ric Maris, Elise Perrotin, Pierre R\u00e9gnier: A lightweight epistemic logic and its application to planning. Artif. Intell. 298: 103437 (2021)<\/li><\/ul><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2136\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-2136\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Oct 27 16:00-17:30 Xiao Liu \u5218\u6f47 (Tsinghua University): The Consistency of Rationality Measurement<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2136\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2136\"><p><strong>Abstract:Individual rationality plays a central role in modern economic theory, while how to measure rationality has been quite challenging. In particular, whether the rationality measured in different domains is stable or not is an open question. Combining consumers\u2019 purchase data from a large supermarket chain and their choice in a survey experiment, we directly examine three important questions for rationality measurements: (1) external validity: can rationality measured in the survey experiment successfully predict consumers\u2019 actual purchase behavior; (2) cross validity: is rationality exhibited in risk preference consistent with that in social preference? (3) time stability: does an individual\u2019s rationality level vary with time windows?<\/strong><\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2137\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-2137\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Nov 03 16:00-17:30 Yi Wang \u738b\u8f76 (Sun Yat-sen University): \u8ba4\u77e5\u89c6\u89d2\u5916\u7684\u793e\u4f1a\u7f51\u7edc\u903b\u8f91\u7814\u7a76<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2137\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2137\"><p><strong>Abstract:<\/strong><\/p><p>\u8bb2\u5ea7\u4ee5\u7ed3\u6784\u5e73\u8861\u903b\u8f91\u4e3a\u4f8b\u4ecb\u7ecd\u975e\u4fe1\u606f\u56e0\u7d20\u9a71\u52a8\u7684\u793e\u4f1a\u7f51\u7edc\u66f4\u65b0\u6a21\u578b\u548c\u903b\u8f91\u5b66\u7814\u7a76\u89c6\u89d2\uff0c\u5e76\u89e3\u91ca\u6b64\u7c7b\u5de5\u4f5c\u4e2d\u5e38\u5e38\u9762\u4e34\u7684\u4e00\u4e9b\u6280\u672f\u96be\u9898\uff0c\u987a\u5e26\u4ecb\u7ecd\u62a5\u544a\u4eba\u5728\u8fd9\u4e2a\u9886\u57df\u7684\u8fd1\u671f\u5de5\u4f5c\u548c\u7814\u7a76\u60f3\u6cd5\u3002<br \/>\u53c2\u8003\u6587\u732e\uff1a\u738b\u8f76\uff0c\u300a\u903b\u8f91\u3001\u535a\u5f08\u4e0e\u8ba1\u7b97\u2014\u2014\u793e\u4f1a\u7f51\u7edc\u5e73\u8861\u7814\u7a76\u300b\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2138\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-2138\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Nov 10 16:00-17:30 Katsuhiko Sano (Hokkaido University): Analytic Cut and Mints\u2019 Symmetric Interpolation Method for Bi-intuitionistic Tense Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2138\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2138\"><p><strong>Abstract:<\/strong><\/p><p>This talk establishes the Craig interpolation theorem of bi-intuitionistic stable tense logic BiSKt, which is proposed by Stell et al. (2016). First, we define a sequent calculus G(BiSKt) with the cut rule for the logic and establish semantically that applications of the cut rule can be restricted to analytic ones, i.e., applications such that the cut formula is a subformula of the conclusion of the cut rule. Second, we apply a symmetric interpolation method, originally proposed by Mints (2001) for multi-succedent calculus for intuitionistic logic, to obtain the Craig interpolation theorem of the calculus G(BiSKt). Our argument also provides a simplification of Kowalski and Ono (2017)\u2019s argument for the Craig interpolation theorem of bi-intuitionistic logic. This is joint work with Hiroakira Ono (JAIST).<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2139\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-2139\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Nov 24 16:00-17:30 Rineke Verbrugge (University of Groningen): Zero-one laws for the propositional provability logic GL, S4, and K4<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2139\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2139\"><p><strong>Abstract:<\/strong><\/p><p>It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. For modal logics, limit behavior for models and frames may differ. In 1994, Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5. They also proposed zero-one laws for the corresponding classes of frames, but their zero-one law for K-frames has since been disproved, and so has more recently their zero-one law for S4-frames.<br \/>In this talk, we prove zero-one laws for provability logic with respect to both model and frame validity. Moreover, we axiomatize validity in almost all irreflexive transitive finite models and in almost all irreflexive transitive finite frames, leading to two different axiom systems. In the proofs, we use a combinatorial result by Kleitman and Rothschild about the structure of finite (strict) partial orders: almost all of them consist of only three layers. Finally, we present empirical results in order to give an idea of the number of elements from which onwards a formula\u2019s almost sure validity or almost sure invalidity stabilizes in such three-layer Kleitman-Rothschild frames. We also discuss possible extensions of the zero-one laws to the modal logics S4 and K4.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-21310\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-21310\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Dec 04 09:00~10:30 Hanti Lin \u6797\u7ff0\u8fea (University of California, Davis): The Hopelessness of AGM Belief Revision and the Trinity of Statistics<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-21310\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-21310\"><p><strong>Abstract:The standard theory of belief revision\u2014the AGM theory\u2014has long been challenged with some putative counterexamples, and its defenders often reply by (explicitly or implicitly) following a quite general, powerful strategy. I will describe that reply strategy in detail before I undermine it. More specifically, I will give a class of counterexamples to the AGM theory (and anything stronger) for which the reply strategy no longer works. Worse, my counterexamples are pervasive in science, in the sense that statistical hypothesis testing is pervasive in science. Some weakenings of the AGM theory will then be considered, and their prospects will be assessed (optimistically). I will close by sketching how all this fits into the bigger picture of scientific inference that I defended elsewhere (in the 2022 PSA). If I am right, belief revision theory, when done right, is an important missing part of a good philosophy of statistics.<\/strong><\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-21311\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-21311\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Dec 15 19:00~20:30 Yong Cheng \u7a0b\u52c7 (Wuhan University): The limit of the first incompleteness theorem<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-21311\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-21311\"><p><strong>Abstract\uff1aIn this talk, we examine the limit of the first incompleteness theorem (G1). Goedel-Rosser first incompleteness theorem claims that any consistent recursively axiomatized extension of PA is incomplete. The notion of interpretation provides us a method to compare different theories in distinct languages. We can generalize G1 via the notion of interpretation in an abstract way. For a consistent RE theory T, we define the notion \u201cG1 holds for T\u201d. We examine the question: are there minimal theories for which G1 holds. The answer of this question depends on how we define the notion of minimality. We first review some known results of this question in the literature based on different notions of minimality. Then we examine the question: are there minimal theories for which G1 holds with respect to interpretation. We know that G1 holds for essentially undecidable theories. Effectively inseparable (EI) theories are much stronger than essentially undecidable theories, and G1 holds for EI theories. A natural question is: are there minimal EI theories with respect to interpretation? We negatively answer this question and prove that there are no minimal effectively inseparable theories with respect to interpretation: for any EI theory T, we can effectively find a theory which is EI and strictly weaker than T with respect to interpretation. We give two different proofs of it. Finally, if time allows, we give a brief discussion of the limit of the second incompleteness theorem.<\/strong><\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-21312\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-21312\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Dec 22th 16:00~17:30 Minghui Ma \u9a6c\u660e\u8f89 (Sun Yat-sen University) Negative Translations in Intuitionistic Tense Logics<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-21312\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-21312\"><p><strong>Abstract:<\/strong><\/p><p>There are various negative translations from classical propositional logic (CPL) into intuitionistic propositional logic (IPL). Glivenko\u2019s double negation translation is one of the fundamental negative translations from which other embeddings are derived. In this lecture, we sketch the algebraic, semantical and proof-theoretic methods for proving Glivenko\u2019s embedding of CPL into IPL. After a short look back to the Glivenko type theorems for intuitionistic modal logics, we introduce recent work on negative translations, including the Kolmogorov, Goedel-Gentzen and Kuroda, for intuitionistic tense logics based on Ewald\u2019s logic IKt. We show a new cut-free sequent calculus for IKt, and then by the proof-theoretic method, we show that the three types of negative translation embedding hold for intionistic tense logics which are axiomatizable by strictly positive formulas. Finally we give a new characterization of Glivenko type theorem for intuitionistic tense logics.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-94bec01 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"94bec01\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-f02c31b\" data-id=\"f02c31b\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-9e72011 elementor-widget elementor-widget-heading\" data-id=\"9e72011\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2021-2022 Spring Semester<\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-b98b8cd elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"b98b8cd\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-e5f2256\" data-id=\"e5f2256\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-dcc65b8 elementor-widget elementor-widget-toggle\" data-id=\"dcc65b8\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2311\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-2311\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Feb 24 16:00-17:30 Chong Chi Tat \u5e84\u5fd7\u8fbe (National University of Singapore): Nonstandard Models of Arithmetic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2311\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2311\"><p><strong>Abstract:<\/strong><\/p><p>The notion of a nonstandard model was introduced by Skolem almost 90 years ago. Since then, nonstandard models have been a subject of study in mathematical logic. In recent years, such structures were successively used to investigate combinatorial problems in reverse mathematics. This talk will give a brief introduction of the key features of a nonstandard model, provide some examples, and discuss the role of nonstandard models in metamathematical investigations, as well as in the philosophy of mathematics.<\/p><p>\u00a0<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2312\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-2312\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Mar 03 16:00-17:00 Zhiguang Zhao \u8d75\u4e4b\u5149 (Taishan University): Algebraic Correspondence Theory: A Duality-Theoretic Perspective<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2312\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2312\"><p><strong>Abstract:<\/strong>The talk is divided into two parts: the first part gives a brief introduction to the topological duality between Boolean algebras with operators and descriptive general frames as well as the discrete duality between complete atomic Boolean algebras and Kripke frames, and we use this framework to discuss canonicity theory. The second part is an introduction of correspondence theory in an algebraic way, which is modular and easy to generalize to other semantic settings.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2313\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-2313\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Mar 10 16:00-17:00 Zhen Liang \u6881\u771f (Guizhou University): Towards Axiomatisation of Social Epistemic Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2313\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2313\"><p><strong>Abstract:<\/strong>This is a theoretical development of epistemic logic to problems concerning the relationship between perception and knowledge. We closely follow the approach of Seligman, Liu and Girard\u2019s \u201cLogic in the Community\u201d which proposes a two-dimensional multi-agent epistemic logic, in which the model operator K (knows) is supplemented with a \u2018social\u2019 operators which allow reasoning about relations between agents. The logic also uses operators from hybrid logic, such as nominals n, which name agents, the perspective shifting operator @n, which moves to agent n\u2019s perspective, and the downarrow operator \u2193x, which names the current agent a rigid name x. We propose an axiomatisation and completeness proof, using the step-by-step method, first for the basic logic and then for the case of downarrow, which is more involved. While the framework is very general, we are specifically interested in a perceptual agent-oriented operator S (sees). Axioms for the interaction of seeing and knowing are explored. We then consider dynamic extensions of the basic logic with public announcement and \u201cobservational\u201d announcement, in which information is given only to agents who can see the announcer.<\/p><p>\u00a0<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2314\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-2314\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Mar 17 14:00-15:30 Wei Wang \u738b\u5dcd (Tsinghua University): \u79d1\u5b66\u5b9a\u5f8b\u4e0e\u56e0\u679c\u6027<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2314\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2314\"><p><strong>Abstract:<\/strong><\/p><p>\u8fd1\u4ee3\u6765\u5728\u79d1\u5b66\u54f2\u5b66\u4e2d\uff0c\u56e0\u679c\u6027\u5df2\u53d6\u4ee3\u5b9a\u5f8b\u6210\u4e3a\u663e\u5b66\u3002\u7b14\u8005\u8bd5\u56fe\u8bba\u8bc1\uff1aJames Woodward \u7684\u4e0d\u53d8\u6027\u8981\u6c42\u592a\u5f31\uff0c\u53ef\u80fd\u6709\u81ea\u76f8\u77db\u76fe\u6216\u7410\u788e\u65e0\u804a\u7684\u4e0d\u53d8\u6027\uff1b\u6a21\u6001\u6027\u8981\u6c42\u592a\u5f3a\uff0c\u53ef\u80fd\u51fa\u73b0\u5b9e\u9645\u4e0a\u4e0d\u592a\u5408\u7406\u7684\u56e0\u679c\u5173\u7cfb\uff1b\u5b9a\u5f8b\u4e2d\u6240\u5305\u542b\u7684\u6df1\u5c42\u6b21\u6982\u5ff5\uff0c\u53ef\u80fd\u65e0\u6cd5\u4ece\u56e0\u679c\u56fe\u4e2d\u5bfc\u51fa\uff1b\u7279\u6b8a\u79d1\u5b66\u5b9e\u9645\u4e0a\u5f88\u96be\u8fdb\u884c\u6709\u6548\u64cd\u63a7\uff0c\u6570\u7406\u4f20\u7edf\u53ef\u80fd\u6bd4\u5b9e\u9a8c\u4f20\u7edf\u53d1\u6325\u66f4\u5927\u7684\u4f5c\u7528\u3002\u7b14\u8005\u5efa\u8bae\uff0c\u79d1\u5b66\u5b9a\u5f8b\u4e0e\u56e0\u679c\u6027\u53ef\u4ee5\u6709\u6548\u4e92\u8865\uff0c\u5b9a\u5f8b\u201c\u5927\u5904\u7740\u773c\u201d\uff0c\u56e0\u679c\u6027\u201c\u5c0f\u5904\u7740\u624b\u201d\u3002<\/p><p>\u5173\u952e\u8bcd\uff1a\u5b9a\u5f8b\uff0c\u56e0\u679c\u6027\uff0c\u5176\u5b83\u60c5\u51b5\u5747\u540c\u5b9a\u5f8b<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2315\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-2315\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Mar 24 16:00-17:30 Hu Liu \u5218\u864e (Sun Yat-sen University): A Formal Theory of Public Opinion<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2315\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2315\"><p><strong>Abstract:<\/strong><\/p><p>Public opinion is a common yet complex phenomenon. We present a formal theory of public opinion for a rigorous platform for the topic, in which opinions are represented by logical formulas. The method of norm forms is used to simplify the problem. We present various aggregation conditions and aggregation functions. We study in detail a specific function. It reflects a common usage that public opinions are the most popular opinions among the public. We prove a characterization theorem for this kind of public opinions, saying that it is the only one that satisfies six fairness conditions.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2316\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-2316\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Mar 31 16:00-17:30 Jouko V\u00e4\u00e4n\u00e4nen (University of Helsinki): Dependence logic: Some recent developments<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2316\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2316\"><p><strong>Abstract:<\/strong>In the traditional so-called Tarski\u2019s Truth Definition the semantics of first order logic is defined with respect to an assignment of values to the free variables. A richer family of semantic concepts can be modelled if semantics is defined with respect to a set (a \u201cteam\u201d) of such assignments. This is called team semantics. Examples of semantic concepts available in team semantics but not in traditional Tarskian semantics are the concepts of dependence and independence. Dependence logic is an extension of first-order logic based on team semantics. It has emerged that teams appear naturally in several areas of sciences and humanities, which has made it possible to apply dependence logic and its variants to these areas. In my talk I will give a quick introduction to the basic ideas of team semantics and dependence logic as well as an overview of some new developments, such as quantitative analysis of team properties, a framework for a multiverse approach to set theory, and probabilistic independence logic inspired by the foundations of quantum mechanics.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2317\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-2317\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Apr 07 16:00-17:30 Yuhao Wang \u738b\u79b9\u7693 (Tsinghua University): Long-term Causal Inference Under Persistent Confounding via Data Combination<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2317\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2317\"><p><strong>Abstract:<\/strong>We study the identification and estimation of long-term treatment effects when both experimental and observational data are available. Since the long-term outcome is observed only after a long delay, it is not measured in the experimental data, but only recorded in the observational data. However, both types of data include observations of some short-term outcomes. In this paper, we uniquely tackle the challenge of persistent unmeasured confounders, i.e., some unmeasured confounders that can simultaneously affect the treatment, short-term outcomes and the long-term outcome, noting that they invalidate identification strategies in previous literature. To address this challenge, we exploit the sequential structure of multiple short-term outcomes, and develop three novel identification strategies for the average long-term treatment effect. We further propose three corresponding estimators and prove their asymptotic consistency and asymptotic normality. We finally apply our methods to estimate the effect of a job training program on long-term employment using semi-synthetic data. We numerically show that our proposals outperform existing methods that fail to handle persistent confounders.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2318\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-2318\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Apr 14 16:00-17:30 Valentin Goranko (Stockholm University): Logic-based Strategic Reasoning in Social Context<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2318\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2318\"><p><strong>Abstract:<\/strong><\/p><p>Reasoning in social context has many important aspects, one of which is the reasoning about strategic abilities of individuals (agents) and groups (coalitions) of individuals to guarantee the achievement of their desired objectives while acting within the entire society. Several logical systems have been proposed for formalising and capturing such reasoning, starting with the Coalition Logic (CL), the Alternating Time Temporal Logic (ATL) and some extensions of these, introduced the early 2000s.<\/p><p>Coalition Logic provides a natural, but rather restricted perspective: the agents in the proponent coalition are viewed as acting in full cooperation with each other but in complete opposition to all agents outside of the coalition, which are thus treated as adversaries. The Alternating Time Temporal Logic extends Coalition Logic with temporal operators allowing for expressing long-term temporised goals.<\/p><p>The strategic interaction in real life is much more complex, usually involving various patterns combining cooperation and competition. To capture these, more expressive and versatile logical frameworks are needed.<\/p><p>In this talk I will first present briefly Coalition Logic and then will introduce and discuss some more expressive and versatile logical systems, including: (i) the Socially Friendly Coalition Logic (SFCL), enabling formal reasoning about strategic abilities of individuals and groups to ensure achievement of their private goals while allowing for cooperation with the entire society; (ii) the complementary, Group Protecting Coalition Logic (GPCL), capturing reasoning about strategic abilities of the entire society to cooperate in order to ensure achievement of the societal goals, while simultaneously protecting the abilities of individuals and groups within the society to achieve their individual and group goals.<\/p><p>Finally, time permitting, I will discuss briefly conditional strategic reasoning, where agents reason about their strategic abilities conditional on the actions that they expect the other agents to take.<\/p><p>In conclusion, I will take a more general perspective on a unifying logic-based framework for strategic reasoning in social context.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2319\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-2319\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 Apr 29 18:30-20:00 Alexandru Baltag (University of Amsterdam): The Topology of Surprise<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2319\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2319\"><p><strong>Abstract:<\/strong><\/p><p>I present a topological epistemic logic, motivated by a famous epistemic puzzle: the Surprise Exam Paradox. It is a modal logic, with modalities for knowledge (modelled as the universal modality) and knowability of a proposition (represented by the topological interior operator), and (un)knowability of the actual world. The last notion has a non-self-referential reading (modelled by Cantor derivative: the set of limit points of a given set) and a self-referential one (modelled by Cantor\u2019s perfect core of a given set: its largest subset without isolated points). I completely axiomatize this logic, showing that it is decidable and PSPACE-complete. I point its connections to my older joint work on topological mu-calculus, and finally I apply it to the analysis of the Surprise Exam Paradox (in both its non-self-referential and its self-referential versions). This talk is based on recent joint work with Nick Bezhanishvili and David Fernandez-Duque.<\/p><p>Reference.<br \/>Baltag, A.; Bezhanishvili, N.; and Fern\u00b4andez-Duque, D. 2022. The topology of surprise. Accepted for presentation at the KR workshop, affiliated with LICS 37. To appear in the KR Proceedings.<br \/>Baltag, A.; Bezhanishvili, N.; and Fern\u00b4andez-Duque, D. 2021. The topological mu-calculus: completeness and decidability. In Proceedings. of LICS 36, 1\u201313. IEEE Press.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-23110\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-23110\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 May 07 09:30-11:00 Adam Bjorndahl (Carnegie Mellon University) Knowledge Second<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-23110\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-23110\"><p><strong>Abstract:<\/strong>Classical philosophical analyses seek to explain knowledge as deriving from more basic notions. The influential \u201cknowledge first\u201d program in epistemology reverses this tradition, taking knowledge as its starting point. From the perspective of epistemic logic, however, this is not so much a reversal as it is the default\u2014the field arguably begins with the specialization of \u201cnecessity\u201d to \u201cepistemic necessity\u201d; that is, it begins with knowledge. In this context, putting knowledge second would be the reversal. This work motivates, develops, and explores such a \u201cknowledge second\u201d approach in epistemic logic, founded on distinguishing what a body of evidence actually entails from what it is (merely) believed to entail. We import a logical framework that captures exactly this distinction, use it to define formal notions of (internal and external) justification, and investigate applications to the KK principle, the regress problem, and the definition of knowledge.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-23111\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-23111\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2022 May 26 16.00-17:30 Dag Westerst\u00e5hl (Stockholm University) Updates on Carnap\u2019s Problem<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-23111\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-23111\"><p><strong>Abstract\uff1a<\/strong>Carnap\u2019s Problem, or Carnap\u2019s Question, as Denis Bonnay and I understand it, is to what extent a consequence relation in some logical language fixes the meaning of the logical constants in that language. This can be seen as relevant to the issue of what \u2018logical\u2019 means. Also, it seems that people can have fairly robust intuitions about \u2018what follows from what\u2019 without having clear ideas about logicality, so it is of some interest to see if and how the former determines the latter. I will give an overview of what has been achieved in this area so far, concerning classical first-order logic, logics with generalized quantifiers, modal logic, and some partial results for intuitionistic propositional logic (the latter is joint work with Haotian Tong). I end by briefly discussing how this approach fares in comparison to other ideas about logicality.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-424a79b elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"424a79b\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-f6d04f2\" data-id=\"f6d04f2\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-ef0ac30 elementor-widget elementor-widget-heading\" data-id=\"ef0ac30\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2021-2022 Autumn Semester<\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-f960e19 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"f960e19\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-5d637fc\" data-id=\"5d637fc\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-d49af02 elementor-widget elementor-widget-toggle\" data-id=\"d49af02\" data-element_type=\"widget\" data-widget_type=\"toggle.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-toggle\" role=\"tablist\">\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2221\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-2221\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-12-17  Guozhen Shen: An Application of Lattice Theory to Non-well-ordered Cardinals<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2221\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2221\"><p><strong>Abstract:\u00a0<\/strong>Using a special kind of Birkhoff lattices, we construct a permutation model in which there exists a finite-to-one function from the symmetric group of an infinite set <em>A<\/em> onto <em>A<\/em>, which cannot exist even in the presence of the axiom of countable choice. This is a joint work with Jiachen Yuan.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2222\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-2222\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-12-30  Beishui Liao: \u8bba\u65b0\u4e00\u4ee3\u4eba\u5de5\u667a\u80fd\u4e0e\u903b\u8f91\u5b66\u7684\u4ea4\u53c9\u7814\u7a76<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2222\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2222\"><p><strong>Abstract: <\/strong>\u65b0\u4e00\u4ee3\u4eba\u5de5\u667a\u80fd\u4ee5\u5927\u6570\u636e\u548c\u673a\u5668\u5b66\u4e60\u6280\u672f\u4e3a\u6838\u5fc3\uff0c\u5b9e\u884c\u7684\u662f\u8054\u7ed3\u4e3b\u4e49\u7684\u8def\u5f84\u3002\u8be5\u8def\u5f84\u5728\u573a\u666f\u5c01\u95ed\u7684\u6570\u636e\u5bc6\u96c6\u578b\u5e94\u7528\u4e2d\u53d6\u5f97\u4e86\u5de8\u5927\u6210\u529f\uff0c\u4f46\u9762\u4e34\u53ef\u89e3\u91ca\u6027\u5dee\u3001\u4f26\u7406\u5bf9\u9f50\u56f0\u96be\u3001\u8ba4\u77e5\u63a8\u7406\u80fd\u529b\u5f31\u7b49\u74f6\u9888\u95ee\u9898\u3002\u4e3a\u4e86\u5728\u4e00\u5b9a\u7a0b\u5ea6\u4e0a\u89e3\u51b3\u8fd9\u4e9b\u95ee\u9898\uff0c\u4e0d\u53ef\u907f\u514d\u5730\u6d89\u53ca\u5230\u5bf9\u5f00\u653e\u3001\u52a8\u6001\u3001\u771f\u5b9e\u73af\u5883\u4e2d\u4fe1\u606f\u7684\u523b\u753b\uff0c\u4ee5\u53ca\u5bf9\u4eba\u7c7b\u63a8\u7406\u548c\u89e3\u91ca\u673a\u5236\u7684\u5efa\u6a21\u3002\u5f62\u5f0f\u8bba\u8fa9\u53ef\u4ee5\u63d0\u4f9b\u4e0d\u4e00\u81f4\u60c5\u5883\u4e0b\u77e5\u8bc6\u8868\u793a\u4e0e\u63a8\u7406\u7684\u901a\u7528\u673a\u5236\uff0c\u4e0e\u504f\u597d\u3001\u6743\u91cd\u3001\u6982\u7387\u7b49\u51b3\u7b56\u56e0\u7d20\u7684\u7075\u6d3b\u7ed3\u5408\u673a\u5236\uff0c\u5c40\u90e8\u5316\u548c\u6a21\u5757\u5316\u7684\u8bed\u4e49\u9ad8\u6548\u8ba1\u7b97\u673a\u5236\uff0c\u4ee5\u53ca\u57fa\u4e8e\u8bba\u8bc1\u548c\u5bf9\u8bdd\u7684\u53ef\u89e3\u91ca\u673a\u5236\u7b49\u3002\u6709\u673a\u7ed3\u5408\u5f62\u5f0f\u8bba\u8fa9\u4e0e\u73b0\u6709\u5927\u6570\u636e\u548c\u673a\u5668\u5b66\u4e60\u6280\u672f\uff0c\u6709\u671b\u5728\u4e00\u5b9a\u7a0b\u5ea6\u4e0a\u7a81\u7834\u73b0\u6709\u6280\u672f\u74f6\u9888\uff0c\u4fc3\u8fdb\u65b0\u4e00\u4ee3\u4eba\u5de5\u667a\u80fd\u7684\u5065\u5eb7\u53d1\u5c55\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2223\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-2223\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-12-09 Johan van Benthem: Interleaving Logic and Counting<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2223\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2223\"><p><strong>Abstract: <\/strong>Reasoning with generalized quantifiers in natural language combines logical and arithmetical features, transcending divides between qualitative and quantitative. This practice blends with inference patterns in \u2018grassroots mathematics\u2019 such as pigeon-hole principles. Our topic is this cooperation of logic and counting, studied with small systems and gradually moving upward. We start with monadic first-order logic with counting. We provide normal forms that allow for axiomatization, determine which arithmetical notions are definable, and conversely, discuss which logical notions and reasoning principles can be defined out of arithmetical ones. Next we study a series of strengthenings in the same style, including second-order versions, systems with multiple counting, and a new modal logic with counting. As a complement to our fragment approach, we also discuss another way of controlling complexity: changing the semantics of counting to reason about \u2018mass\u2019 or other aggregating notions than cardinalities. Finally, we return to natural language, confronting our formal systems with linguistic quantifier vocabulary, monotonicity reasoning, and procedural semantics via semantic automata. We conclude with some pointers to further entanglements of logic and counting in formal systems, in philosophy of logic, and in cognitive psychology.<\/p><p>Paper available at: <a href=\"https:\/\/eprints.illc.uva.nl\/id\/eprint\/1813\/1\/Logic.Counting.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">https:\/\/eprints.illc.uva.nl\/id\/eprint\/1813\/1\/Logic.Counting.pdf<\/a><\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2224\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-2224\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-11-27 Thomas Icard: Applications of Logic to Causal AI<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2224\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2224\"><p><strong>Abstract: <\/strong>Much of causality and causal inference can be understood profitably through the lens of modern logic. In this talk we present two applications of this study to artificial intelligence. The first concerns the theoretical and empirical limitations of causal inference from observational and experimental data. The second involves the use of causal-logical tools to derive abstract and human-interpretable analyses of opaque AI systems trained with large, complex data. The broader aim of the talk will be to illustrate the potential for symbiosis between theoretical work in logic and practical work in AI.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2225\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-2225\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-11-18 Yifeng Di: Propositional Quantifiers and Doxastic Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2225\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2225\"><p><strong>Abstract: <\/strong>We discuss several questions regarding doxastic logic with propositional quantifiers. First, suppose we take the normal modal logic KD45 as the starting point of the logic of belief, with propositional quantifiers, what logics are available to us, and can we show completeness with respect to some established semantics for belief? To this end, we identify two key principles: the immodesty principle (I believe that everything I believe is true), and the quantificational introspection principle (if no matter what p is, I believe in phi, then I believe that no matter what p is, I believe in phi). We show that, on the one hand, to invalidate the immodesty principle, we need to deviate from the standard possible world semantics, and on the other hand, it is very hard to avoid the quantificational introspection principle since every complete modal algebra validating KD45 also validates it, though it is not derivable in KD45 with the usual axioms for propositional quantifiers. We will also touch on the issue of belief as credence 1. Then, time permitting, we shall consider deviations even from KD45. We will show how rejecting immodesty also puts pressure on introspection (in particular negative introspection) and discuss logical issues specifically with propositional quantifiers coming out of rejecting introspection.\u00a0<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2226\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-2226\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-11-11 Asher Jiang: Truthmaking Cannot be Done Afar<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2226\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2226\"><p><strong>Abstract: <\/strong>As concerns the explication of the intuitive notion of truthmaking, Barry Smith has an insight that deserves more attention. Basically, in his view, an object x makes a proposition<\/p><p>true iff (\u03b1) x necessitates<\/p><p>and (\u03b2)<\/p><p>is representationally closely tied with x. To be more specific, he suggests that (\u03b2) is fulfilled only if x is among<\/p><p>\u2019s ontological commitments. I appreciate his basic insight but reject his specific suggestion. I argue that we can make a more attractive proposal from his basic insight if we take into consideration that the close tie can also be realized by<\/p><p>\u2019s being about x.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2227\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-2227\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-11-04 Thomas Studer: Justification Logic \u2013 Introduction and Recent Developments<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2227\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2227\"><p><strong>Abstract: <\/strong>Justification logics are closely related to modal logics and can be viewed as a refinement of the latter with machinery for justification manipulation. Justifications are represented directly in the language by terms, which can be interpreted as formal proofs in a deductive system, evidence for knowledge, and so on. This more expressive language proved beneficial in both proof theory and epistemology and helped investigate problems ranging from a classical provability semantics for intuitionistic logic to the logical omniscience problem.<br \/>In this talk, we will give an introduction to justification logic and present recent developments in the field such as subset models, conflict tolerant logics, and formalizations of zero-knowledge proofs.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2228\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-2228\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-10-28 Jan Broersen: What are Suitable Logic Models of General ability?<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2228\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2228\"><p><strong>Abstract: <\/strong>I will consider different alternatives for giving logic models of ability. First I will explain the difference between possibilities for action and (general) abilities. Then I will focus on the role of knowledge and knowing how in understanding and modelling ability. The importance of modeling these concepts is motivated by discussing their application in symbolic and responsible AI.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-2229\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-2229\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-10-21 Haosui Duanmu\uff1aApplications of Nonstandard Analysis to Probability, Statistics and Economics<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2229\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2229\"><p><strong>Abstract: <\/strong>Nonstandard analysis, a powerful machinery derived from mathematical logic, has had many applications in various areas of mathematics such as probability theory, stochastic processes, mathematical physics, functional analysis, and mathematical economics. Nonstandard analysis allows construction of a single object a hyperfinite probability space which satisfies all the first-order logical properties of a finite probability space, but which can be simultaneously viewed as a measure-theoretical probability space via the Loeb construction. As a consequence, the hyperfinite\/measure duality has proven to be particularly in porting discrete results into their continuous settings. We present several applications of this novel approach:<br \/>(1) Extending known results for discrete Markov processes to analogues results for general Markov processes (e.g., ergodicity of Markov processes, mixing and hitting times of Markov processes);<br \/>(2) Establishing tight connections between frequentist optimality and Bayes optimality for general statistical decision problems;<br \/>(3) Existence of Walrasian equilibrium for exchange\/production economy models<br \/>that are specific to climate change.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-22210\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-22210\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-10-14 Malvin Gattinger\uff1aSymbolic and Succinct Perspective Shifts for Faster Epistemic Planning<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-22210\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-22210\"><p><strong>Abstract:\u00a0<\/strong>Dynamic Epistemic Logic can be used for Epistemic Planning, as shown in several recent works, ranging from theoretical proposals to actual implementations on robots. A crucial part of automated epistemic planning is to compute perspective shifts that let agents take into account the knowledge of others. So far, these perspective shifts are usually done using explicit Kripke models which may grow exponentially in the number of agents or propositions. I will discuss methods to tackle this state-explosion problem and show how to compute perspective shifts without explicit Kripke models. The two methods I will present are based on symbolic structures and succinct models. Both are compact representations from previous literature showing how to speed up model checking DEL. The new definitions aim to make epistemic planning more efficient in the future. Most of the talk will be based on the article available here: (https:\/\/malv.in\/2020\/EpiP-perspective-shifts.pdf) Time permitting, I will also present related software recently developed by my students and myself.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-22211\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-22211\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-10-7 Mingming Liu: \u4ece\u201c\u90fd\u201d\u7684\u8bed\u5883\u9002\u7528\u6761\u4ef6\u770b\u4ec0\u4e48\u662f\u201c\u603b\u62ec\u201d<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-22211\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-22211\"><p><strong>Abstract\uff1a<\/strong>\u4f20\u7edf\u5206\u6790\u8ba4\u4e3a\u201c\u90fd\u201d\u8868\u793a\u201c\u603b\u62ec\u201d\uff08\u5415\u53d4\u6e58\uff0c1980\uff09\u3002\u6211\u4eec\u53d1\u73b0[\u590d\u6570\u6027\u540d\u8bcd\u6210\u5206+\u201c\u90fd\u201d]\u4e2d\u201c\u90fd\u201d\u662f\u5426\u51fa\u73b0\u53d7\u8bed\u5883\u5236\u7ea6\u3002\u5927\u81f4\u8bf4\u6765\uff0c\u5f53\u590d\u6570\u6027\u540d\u8bcd\u6210\u5206\u6240\u5728\u7684\u53e5\u5b50\u6ca1\u6709\u72ec\u7acb\u5b8c\u6574\u56de\u7b54\u8bed\u5883\u4e2d\u7684\u95ee\u9898\u65f6\uff0c\u201c\u90fd\u201d\u6700\u597d\u4e0d\u51fa\u73b0\uff1b\u53cd\u4e4b\uff0c\u201c\u90fd\u201d\u901a\u5e38\u9700\u8981\u51fa\u73b0\u3002\u4ece\u201c\u90fd\u201d\u7684\u8fd9\u4e00\u8bed\u5883\u9002\u7528\u6761\u4ef6\u51fa\u53d1\uff0c\u6211\u4eec\u63d0\u51fa\u201c\u90fd\u201d\u603b\u62ec\u7684\u662f\u8bed\u5883\u4e2d\u7684\u8bdd\u9898\/\u95ee\u9898\uff08Roberts 1996\uff09\uff1b\u201c\u603b\u62ec\u201d\u8bf4\u7684\u662f\uff0c\u201c\u90fd\u201d\u8868\u8fbe\u4e86\u4e0e\u4e4b\u7ed3\u5408\u7684\u53e5\u5b50\u5305\u62ec\u4e86\u5f53\u524d\u8bdd\u9898\u4e0b\u7684\u6240\u6709\u5185\u5bb9\uff0c\u56e0\u800c\u5177\u6709\u201c\u6392\u9664\u8c08\u8bdd\u4e2d\u5176\u4ed6\u4eba\u6216\u4e8b\u7269\u201d(\u9646\u5e86\u548c\uff0c2006)\u7684\u529f\u80fd\u3002\u540c\u65f6\uff0c\u4e3a\u4e86\u6ee1\u8db3\u201c\u603b\u62ec\u201d\uff0c\u8ddf\u201c\u90fd\u201d\u7ed3\u5408\u7684\u53e5\u5b50\u5fc5\u987b\u53d6\u5206\u914d\u89e3\u8bfb\uff0c\u8fd9\u9020\u6210\u4e86\u201c\u90fd\u201d\u7684\u201c\u5206\u914d\u6548\u5e94\u201d\u3002\u6211\u4eec\u8ba4\u4e3a\uff0c\u8fd9\u79cd\u89e3\u91ca\u53ef\u4ee5\u8ba9\u6211\u4eec\u5bf9\u201c\u90fd\u201d\u7684\u201c\u603b\u62ec\u4e49\u201d\uff0c\u201c\u751a\u81f3\u4e49\u201d\u548c\u201c\u53cd\u9884\u671f\u201d\u6548\u679c\u6709\u7edf\u4e00\u7684\u8ba4\u8bc6\u3002\u66f4\u8fdb\u4e00\u6b65\uff0c\u6211\u4eec\u63d0\u51fa\u201c\u90fd\u201d\u7684\u201c\u603b\u62ec\u4e49\u201d\u662f\u4e00\u4e2a\u9884\u8bbe\uff0c\u8fd9\u4f7f\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u201c\u5f3a\u5236\u6027\u9884\u8bbe\u201d\u73b0\u8c61\u6765\u89e3\u91ca\u201c\u90fd\u201d\u4e3a\u4ec0\u4e48\u5728\u67d0\u4e9b\u73af\u5883\u4e0b\u5fc5\u987b\u51fa\u73b0\uff08Liu 2021\uff09\u3002\u6700\u540e\uff0c\u672c\u6b21\u62a5\u544a\u5c06\u63a2\u8ba8\u5982\u4f55\u5c06\u6211\u4eec\u7684\u5206\u6790\u63a8\u5e7f\u81f3\u201c\u90fd\u201d\u4e0e\u5176\u4ed6\u540d\u8bcd\u6210\u5206\u642d\u914d\u7684\u60c5\u51b5\uff0c\u4ee5\u53ca\u89e3\u91ca\u201c\u90fd\uff0c\u5c31\u201d\u4e3a\u4f55\u7ecf\u5e38\u51fa\u73b0\u5728\u65e0\u6761\u4ef6\u53e5\u4e0e\u6761\u4ef6\u53e5\u7684\u540e\u4ef6\u4e2d\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-22212\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-22212\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-09-30  Olivier Roy: Epistemic Rights in the Theory of Normative Positions<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-22212\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-22212\"><p><strong>Abstract:\u00a0<\/strong>For a long time now, deontic logicians have studied the typology of legal rights that Wesley Hohfeld proposed at the beginning of the 20th century. This has become known as the theory of normative positions. However, one prominent type of legal rights, so-called epistemic rights, has not yet been systematically studied in the hohfeldian typology. In this talk, I will present recent and ongoing work with R\u00e9ka Markovich (Luxembourg) in which we take the first steps towards filling this gap. I will consider two prominent epistemic rights, the right to know and freedom of thought, and one application of the resulting theory to a recent example in US law.<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<div class=\"elementor-toggle-item\">\n\t\t\t\t\t<div id=\"elementor-tab-title-22213\" class=\"elementor-tab-title\" data-tab=\"13\" role=\"tab\" aria-controls=\"elementor-tab-content-22213\" aria-expanded=\"false\">\n\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon elementor-toggle-icon-left\" aria-hidden=\"true\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-closed\"><i class=\"fas fa-caret-right\"><\/i><\/span>\n\t\t\t\t\t\t\t\t<span class=\"elementor-toggle-icon-opened\"><i class=\"elementor-toggle-icon-opened fas fa-caret-up\"><\/i><\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<\/span>\n\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"\" class=\"elementor-toggle-title\">2021-09-23, Zhuanghu Liu: \u96c6\u4f53\u8ba4\u5b9a\u4e2d\u7684\u4e0d\u4e00\u81f4\u548c\u5408\u53d6\u539f\u5219<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-22213\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"13\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-22213\"><p><strong>Abstract:\u00a0<\/strong>\u96c6\u4f53\u8ba4\u5b9a\u662f\u6309\u4e00\u5b9a\u7684\u89c4\u5219\uff0c\u7efc\u5408\u96c6\u4f53\u4e2d\u6bcf\u4e2a\u4eba\u7684\u610f\u89c1\uff0c\u5bf9\u547d\u9898\u7684\u4e00\u79cd\u65ad\u5b9a\u3002\u6cd5\u5f8b\u5ba1\u5224\u4e2d\u7684\u966a\u5ba1\u5458\u5236\u5ea6\uff0c\u793e\u4f1a\u653f\u6cbb\u751f\u6d3b\u4e2d\u7684\u9009\u4e3e\u3001\u51b3\u8bae\u7b49\u90fd\u662f\u96c6\u4f53\u8ba4\u5b9a\u7684\u5178\u578b\u4f8b\u5b50\u3002<\/p><p>\u4eba\u4eec\u5f88\u65e9\u5c31\u53d1\u73b0\uff0c\u96c6\u4f53\u8ba4\u5b9a\u4e2d\u4f1a\u51fa\u73b0\u4e0d\u4e00\u81f4\uff0c\u5408\u7406\u7684\u8ba4\u5b9a\u5f97\u5230\u7684\u82e5\u5e72\u547d\u9898\u653e\u5728\u4e00\u8d77\u53ef\u4ee5\u662f\u4e0d\u4e00\u81f4\u7684\u3002\u4eba\u4eec\u7684\u7814\u7a76\u5f80\u5f80\u4ece\u793e\u4f1a\u5b66\u7684\u89d2\u5ea6\u51fa\u53d1\uff0c\u96c6\u4e2d\u5728\u5bf9\u4e8e\u89c4\u5219\u5408\u7406\u6027\u7684\u8ba8\u8bba\uff0c\u800c\u4e0d\u662f\u5bf9\u4e0d\u4e00\u81f4\u73b0\u8c61\u672c\u8eab\u7684\u8ba8\u8bba\u3002<\/p><p>\u96c6\u4f53\u8ba4\u5b9a\u8fd8\u6709\u4e00\u79cd\u7c7b\u4f3c\u4e8e\u4e0d\u4e00\u81f4\u7684\u73b0\u8c61\uff1a\u5408\u53d6\u539f\u5219\u7684\u5931\u6548\u3002\u800c\u5728\u5927\u591a\u6570\u5173\u4e8e\u96c6\u4f53\u8ba4\u5b9a\u7684\u7814\u7a76\u4e2d\uff0c\u5408\u53d6\u539f\u5219\u5931\u6548\u7684\u95ee\u9898\u5e76\u6ca1\u6709\u5f97\u5230\u5145\u5206\u8ba8\u8bba\u3002<\/p><p>\u672c\u6587\u4ece\u73b0\u6709\u7684\u96c6\u4f53\u8ba4\u5b9a\u7684\u89c4\u5219\u51fa\u53d1\uff0c\u603b\u7ed3\u51fa\u4e00\u4e9b\u57fa\u672c\u7684\u539f\u5219\uff0c\u5305\u62ec\u8ba4\u5b9a\u96c6\u4f53\u4e2d\u7684\u4e2a\u4eba\u7684\u539f\u5219\u548c\u8ba4\u5b9a\u96c6\u4f53\u7684\u96c6\u4f53\u7684\u539f\u5219\uff0c\u5728\u8fd9\u4e9b\u539f\u5219\u7684\u57fa\u7840\u4e0a\u5efa\u7acb\u4e86\u96c6\u4f53\u8ba4\u5b9a\u903b\u8f91\u7cfb\u7edf\uff0c\u5728\u6b64\u903b\u8f91\u7cfb\u7edf\u4e2d\u4e25\u683c\u5b9a\u4e49\u4e86\u4e0d\u4e00\u81f4\u548c\u5408\u53d6\u539f\u5219\uff0c\u7ed9\u51fa\u5e76\u8bc1\u660e\u4e86\u4e0d\u4e00\u81f4\u73b0\u8c61\u4ea7\u751f\u548c\u5408\u53d6\u539f\u5219\u5931\u6548\u7684\u6761\u4ef6\u3002<\/p><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-fb748bb elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"fb748bb\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-34536a0\" data-id=\"34536a0\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-beb2e97 elementor-widget elementor-widget-spacer\" data-id=\"beb2e97\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-ff8fa2d elementor-widget elementor-widget-heading\" data-id=\"ff8fa2d\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2020-2021 Spring Semester<\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-9dd4601 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"9dd4601\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-5cdd1e9\" data-id=\"5cdd1e9\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-3164e5b elementor-widget elementor-widget-text-editor\" data-id=\"3164e5b\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.5.6 - 28-02-2022 *\/\n.elementor-widget-text-editor.elementor-drop-cap-view-stacked .elementor-drop-cap{background-color:#818a91;color:#fff}.elementor-widget-text-editor.elementor-drop-cap-view-framed .elementor-drop-cap{color:#818a91;border:3px solid;background-color:transparent}.elementor-widget-text-editor:not(.elementor-drop-cap-view-default) .elementor-drop-cap{margin-top:8px}.elementor-widget-text-editor:not(.elementor-drop-cap-view-default) .elementor-drop-cap-letter{width:1em;height:1em}.elementor-widget-text-editor .elementor-drop-cap{float:left;text-align:center;line-height:1;font-size:50px}.elementor-widget-text-editor .elementor-drop-cap-letter{display:inline-block}<\/style>\t\t\t\t<ul><li>2021-5-20 Lian Zhou: Co-reference Without Referent<\/li><li><p>2021-5-13 Qingbian Ma: Decision Making in the Emergency Room<\/p><\/li><li><p>2021-4-29 Qi Feng: Cantor and Set Theory<\/p><\/li><li><p>2021-4-22 Jialong Zhang: Bertrand Russell and Mathematical Logic<\/p><\/li><\/ul>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-5df9893 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"5df9893\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-6174d6c\" data-id=\"6174d6c\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-ad3d844 elementor-widget elementor-widget-spacer\" data-id=\"ad3d844\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-cee656d elementor-widget elementor-widget-heading\" data-id=\"cee656d\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2020-2021 Autumn Semester<\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-f01b6da elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"f01b6da\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-4a833b9\" data-id=\"4a833b9\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-3313b57 elementor-widget elementor-widget-text-editor\" data-id=\"3313b57\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<ul><li>2021-1-10, Lingyuan Ye: Uniformity, Contingency, and Self-reference in Arithmetic &amp;\u00a0Xiao Li: Towards a Semantic Concept of Aboutness<\/li><li>2020-12-25,\u00a0 Duoyi Fei: A Defense for the State of Internal Knowledge<\/li><li>2020-12-04, \u00a0Changsheng Lai:\u00a0\u00a0Epistemic Gradualism and the Gradability of Truth<\/li><li>2020-12-11, Kang Liu:\u00a0 From Vectors to Symbols.<\/li><li>2020-11-12,\u00a0\u00a0Thomas Bolander and Lasse Dissing: Implementing Theory of Mind on a Robot Using Dynamic Epistemic Logic.\u00a0<\/li><li>2020-11-06, \u00a0Zhisheng Huang:\u00a0\u00a0Application of Logic in Data Mining<\/li><\/ul>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-2c011cd elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"2c011cd\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-280100c\" data-id=\"280100c\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-23249a2 elementor-widget elementor-widget-spacer\" data-id=\"23249a2\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-1c398f8 elementor-widget elementor-widget-heading\" data-id=\"1c398f8\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\"><span style=\"margin-top: 1.25em; margin-bottom: 0.5rem; font-size: 2.0736em; font-weight: 400; color: rgb(48, 49, 51); line-height: 1.25em; text-rendering: optimizeLegibility; font-family: &quot;Source Sans Pro&quot;, Arial, sans-serif; white-space: normal;\">Events in 2019-2020 Autumn Semester<\/span><\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-1cd4a81 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"1cd4a81\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-cafa951\" data-id=\"cafa951\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-a1c9189 elementor-widget elementor-widget-text-editor\" data-id=\"a1c9189\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<ul><li>2020-1-08, Fengkui Ju: Towards a Logical Theory of Temporal Conditionals &amp; Xinwen Liu: Jin Yuelin\u2019s Encounter with C.P. Peirce<\/li><li>2019-11-28, Shengyang Zhong: On Quantum Logic<\/li><li>2019-11-14, Martin Stokhof: Natural Language, Formal Language: a Complex Relationship<\/li><li>2019-10-23, Dazhu Li: Dynamic Epistemic Logic of Social Influence; Kaibo Xie (UvA and Tsinghua) : Formal Semantics for Counterfactuals<\/li><li>2019-10-10, Frank Veltman: On Imperatives in Natural Language.<\/li><\/ul>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>Events in 2024-2025 Fall Semester 2024 Sep 04 16:00-17: [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/4211"}],"collection":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/types\/page"}],"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=4211"}],"version-history":[{"count":30,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/4211\/revisions"}],"predecessor-version":[{"id":8763,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/4211\/revisions\/8763"}],"wp:attachment":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/media?parent=4211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}