{"id":4228,"date":"2022-02-19T03:56:05","date_gmt":"2022-02-18T19:56:05","guid":{"rendered":"http:\/\/tsinghualogic.net\/JRC\/?page_id=4228"},"modified":"2025-02-14T21:59:37","modified_gmt":"2025-02-14T13:59:37","slug":"past-sessions","status":"publish","type":"page","link":"http:\/\/tsinghualogic.net\/JRC\/past-sessions\/","title":{"rendered":"Past Sessions"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"4228\" class=\"elementor elementor-4228\" 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-07cfadd elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"07cfadd\" 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-b1729c5\" data-id=\"b1729c5\" 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-27aa127 elementor-widget elementor-widget-heading\" data-id=\"27aa127\" 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><h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2024-2025 Fall Semester<\/h3>\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-54f4cbd elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"54f4cbd\" 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-968c17e\" data-id=\"968c17e\" 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-67d56a1 elementor-widget elementor-widget-toggle\" data-id=\"67d56a1\" 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-1081\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-1081\" 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 September 12 13:30-15:30 Bonan Zhao (\u8d75\u535a\u56e1 Princeton University) Computational models of causal generalization<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1081\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1081\"><p><strong>Abstract:<\/strong><\/p><p>Computational Cognitive Science is an interdisciplinary field seeking to understand human cognition and intelligence through computational principles. Logic has played fundamental roles in the early development of cognitive science, and keeps influencing today\u2019s most cutting-edge research in the field. In this talk, I will briefly introduce the historical connection between logic and cognitive science, and share some of my work combining formal representations, probabilistic inference, and behavioral experiments, to account for how people synthesize concepts from very few data and generalize to novel situations.<\/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-1082\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-1082\" 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 September 19 14:00-15:30 Wenjuan Li (\u674e\u6587\u5a1f Beijing Institute of Mathematical Sciences and Applications) Determinacy of omega-languages: from non-determinism to probability<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1082\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1082\"><p><strong>Abstract:<\/strong><\/p><p>I will talk about the interface of the determinacy of\u00a0Gale-Stewart games and automata on infinite words. The Gale-Stewart game\u00a0is a two-player turn-based game with perfect information. Given a\u00a0winning set X, determinacy of X asserts that one of the two players has\u00a0a winning strategy. The winning set X can also be defined by variants\u00a0of finite automata as a set of infinite words accepted by such automata.\u00a0I will review several variants of finite automata on infinite words and\u00a0the determinacy studies along this topic, then introduce our studies on\u00a0determinacy strength of infinite games with winning sets defined by\u00a0pushdown and probabilistic automata with various acceptance 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-1083\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-1083\" 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 September 19 16:00-17:30 John Lindqvist (University of Bergen) Distributed belief \u2013 aggregating potentially conflicting information<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1083\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1083\"><p><strong>Abstract:<\/strong><\/p><p>In epistemic logic, the knowledge distributed among a group of agents, or the knowledge possible given the information distributed in the group, can be formalized using the intersection modality. Distributed knowledge can potentially be resolved if the information possessed by the group is shared among its members. However, when we consider belief rather than knowledge, the picture is more complicated. The cumulative information possessed by the agents can be contradictory. In such cases, the distributed belief of the group explodes: the group ends up with distributed belief in everything. Similarly, in such cases, resolving using the intersection operation makes the agents inconsistent.We consider non-explosive alternative definitions of distributed belief, both static and dynamic. For the static case, we offer non-explosive alternative definitions for distributed belief that make use of maximal consistent subgroups. For the dynamic case, we discuss ways of preserving belief properties of individual agents.<\/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-1084\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-1084\" 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 September 26 14:00-15:30 Penghao Du (\u675c\u9e4f\u660a Tsinghua University) Modal logics for the poison game: axiomatization and undecidability<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1084\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1084\"><p><strong>Abstract:<\/strong><\/p><p>Poison modal logic and poison sabotage modal logic have been studied in the existing literature to capture the so-called poison game, which was originally conceived as a paradigm for reasoning about graphical concepts in graph theory and has recently been shown to have significant applications in the theory of abstract argumentation. In this work, we further explore the technical aspects of these two logics and extend existing results by addressing the open questions identified in [Grossi and Rey, 2019, Blando et al., 2020]. Specifically, we show that poison sabotage modal logic has an undecidable satisfiability problem, and we provide both Hilbert-style calculus and tableau calculus for these logics. This is a joint work with Fenrong Liu and Dazhu Li.<\/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-1085\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-1085\" 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 October 10 14:00-15:30 Haoxuan Luo (\u7f57\u660a\u8f69 Tsinghua University) A Semantic Model Based on Inconsistent Sets and Its Corresponding Frame Properties<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1085\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1085\"><p><strong>Abstract:<\/strong><\/p><p>In paraconsistent logic, the Principle of Explosion (ECQ) does not hold, meaning that both a proposition A and its negation \u00acA can be true at the same time. In this talk, I will briefly introduce Non-adjunctive Discursive Logic and Paraconsistent Logic with Preservationism, which introduce the concept of sets of inconsistent formulas. I will then build a model composed of inconsistent sets, where these inconsistent formulas can be derived. I will also discuss the relationship between this model and the Kripke model. Furthermore, I will provide a characterization of the semantics for some classes of frames and explore more results on compactness. This talk is based on my master\u2019s thesis.<\/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-1086\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-1086\" 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 October 10 16:00-17:30 Wenfei Ouyang (\u6b27\u9633\u6587\u98de Tsinghua University) Understanding Dependence Relation and its Representation Theorem<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1086\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1086\"><p><strong>Abstract:<\/strong><\/p><p>In Baltag and van Benthem\u2019s paper [1], three representation theorems are proved for the functional dependence relation (Proposition 2.6). In this talk, we will simplify the construction which is key to the proof. Based on this simplification, we give a more detailed characterization of the construction. We will also disscuss other representation theorems in other related works.<\/p><p><strong>References<br \/><\/strong>[1]\u00a0Baltag, A., van Benthem, J. A Simple Logic of Functional Dependence.\u00a0<em>J Philos Logic<\/em><strong>50<\/strong>, 939\u20131005 (2021).\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-1087\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-1087\" 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 October 24 14:00-15:30 Qingyu He (\u4f55\u6e05\u745c Tsinghua University) Boolean dependence logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1087\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1087\"><p><strong>Abstract:<\/strong><\/p><p>Baltag and van Benthem[1] introduced a logic of functional dependence (LFD) with local dependence formulas and dependence quantifiers, which can be seen both as a first-order and a modal logic. In the relational semantics of LFD, the dependence quantifiers become modalities and local dependence formulas are treated as special atoms. In particular, the modalities involving multiple variables correspond to intersections of relations. This leads to the study on the interaction between LFD and Boolean Modal Logic [2] (BML)\u2014a poly-modal logic where families of binary relations are closed under the Boolean operations of union, intersection, and complement.In this talk, I will present a BML version of LFD, which can express additional notions of dependence. I will provide an axiomatization, including details about its completeness proof. Furthermore, I will extend the framework by introducing conditional independence atoms, and propose an axiomatization for the extended logic.<\/p><p>This is joint work with Chenwei Shi and Qian Chen.<\/p><p>Reference\uff1a<\/p><p>[1] Baltag,\u00a0Alexandru, and Johan van Benthem. \u201cA simple logic of functional dependence.\u201d Journal of Philosophical Logic 50 (2021): 939-1005.<\/p><p>[2] Gargov, George, and Solomon Passy. \u201cA note on Boolean modal logic.\u201d Mathematical logic. Boston, MA: Springer US, 1990. 299-309.<\/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-1088\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-1088\" 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 October 31 14:00-15:30 Xi Yang (\u6768\u66e6 Tsinghua University) Games for Quantifier Numbers<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1088\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1088\"><p><strong>Abstract:<\/strong><\/p><p>Multi-Structural (MS) games and their variants are designed to capture the number of quantifiers needed to express first-order properties. Recently, Carmosino et al. [1] employed MS games to establish tight bounds on the the number of quantifiers needed to define specific properties of ordered structures. In this talk, I will use the techniques and findings from [1] to show that, on the class of finite linear orders, any first-order sentence with a quantifier depth of\u00a0<em>n<\/em>\u00a0is equivalent to a sentence with approximately 2<em>n<\/em>\u00a0quantifiers. Furthermore, I will discuss some potential applications of these games in investigating the succinctness of the finite-variable fragments of first-order logic on linear orders.<\/p><p>Reference:<\/p><p>1. Carmosino, M., Fagin, R., Immerman, N., Kolaitis, P., Lenchner, J., &amp; Sengupta, R. (2024). On the number of quantifiers needed to define boolean functions.\u00a0<em>arXiv<\/em>\u00a0preprint arXiv:2407.00688.<\/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-1089\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-1089\" 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 November 07 14:00-15:30 Siri Yang (\u6768\u601d\u601d Tsinghua University) Transforming Cross Models to Subset Space Models<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1089\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1089\"><p><strong>Abstract:<\/strong><\/p><p>Sets paired with a distinguished collection of subsets, known as subset spaces, are ubiquitous in many areas. In 1996, Andrew Dabrowski, Lawrence S. Moss and Rohit Parikh presented a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The truth of a formula is defined in a point-set pair. Since the logic involves two modalities, this naturally corresponds to Kripke models with two interrelated relations, termed a cross model. It is known that a cross model can be derived from a subset space model, but the problem of the reverse transformation remains unsolved. In this talk, we explore a possible transformation from a cross model back to a subset space model.<\/p><p><br \/>Reference\uff1a<\/p><ol><li>Dabrowski A, Moss L S, Parikh R. Topological reasoning and the logic of knowledge[J]. Annals of Pure and Applied Logic, 1996, 78(1-3): 73-110.<\/li><\/ol><\/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-10810\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-10810\" 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 November 14 14:00-15:30 Lizhu Zhang (\u5f20\u529b\u7af9 Tsinghua University) A Tableau based on a Language of Probability Interval Splitting<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-10810\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-10810\"><p><strong>Abstract:<\/strong><\/p><p>Intuitionistic Probability Logic ILP, which intended to provide an Intuitionistic formalization of reasoning about probability, was proposed by Angelina Ili\u0107-Stepi\u0107 et al. An objective of this presentation is to introduce a translation from ILP formulas to a new language which is designed to split the occurrence of probability intervals in ILP formulas into a minimum consideration range. Also, I will give a tableau based on the new language.<\/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-10811\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-10811\" 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 November 14 16:00-17:30 Wei Wang (\u738b\u5a01 Tsinghua University) Coalition Logic Allowing Dependence: Representation Theorem, Finite Model Property, and Completeness<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-10811\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-10811\"><p><strong>Abstract:<\/strong><\/p><p>Coalition Logic (CL) is a standard and successful logic for reasoning about coalitional power, captured by both effectivity functions from cooperative game theory and (strategic) game forms from non-cooperative game theory, thanks to the representation theorem of truly playable effectivity functions by game forms (see [1]).The axiom of superadditivity in CL precludes dependence between different coalitions\u2019 actions, which is nevertheless ubiquitous. It is natural to ask how to develop a generalization of CL that allows dependence, and can be used to reason about effectivity functions and game forms that allow dependence, which we formulate as dependence-friendlily playable effectivity functions and game forms allowing dependence respectively.In this talk, we will first show our representation theorem of dependence-friendlily playable effectivity functions by game forms allowing dependence. We will then define Coalition Logic Allowing Dependence (CLD), for which we provide a neighbourhood semantics based on effectivity functions and a Kripke semantics based on game forms allowing dependence. We will demonstrate the finite model property of CLD with respect to its neighbourhood models, and in virtue of our representation theorem, prove that CLD is sound and weakly complete with respect to its neighbourhood and Kripke frames.This is joint work with Chenwei Shi.<\/p><p><strong>Reference\uff1a<\/strong><\/p><ol><li>Valentin Goranko, Wojciech Jamroga, and Paolo Turrini. Strategic games and truly playable effectivity functions.\u00a0<em>Autonomous Agents and Multi-Agent Systems<\/em>, 26:288\u2013314, 2013.<\/li><\/ol><\/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-10812\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-10812\" 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 November 21 16:00-17:30 Wenlong Zheng (\u90d1\u6587\u9f99 Tsinghua University) Epistemic dimension of alternative possibilities: Representation with STIT logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-10812\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-10812\"><p><strong>Abstract:<\/strong><\/p><p>\u2018The principle of alternative possibilities\u2019 (PAP), stating that \u2018a person is morally responsible for what he has done only if he could have done otherwise,\u2019 has long been central to discussions of moral responsibility. However,\u00a0Frankfurt\u2019s [1] counterexamples, which challenge PAP, have shifted scholarly focus to actual-sequence views.In this talk, I will introduce an interpretative approach that incorporates an epistemic dimension of alternative possibilities, arguing that while we intuitively consider alternative possibilities when ascribing responsibility, this consideration operates at an epistemic rather than a purely factual level.<\/p><p>Utilizing Canavotto\u2019s [2] refinement of STIT, I will first outline the factual perspective of alternative possibilities and examine the \u2018orthodox\u2019 theory proposed by Fischer and Ravizza [3] along with its possible objections. Then, by extending the model with an epistemic (or doxastic) relation, we emphasize the epistemic aspect of alternative possibilities.<\/p><p><strong>References:<\/strong><\/p><p>[1] Frankfurt, H. (1969). Alternate Possibilities and Moral Responsibilities.\u00a0<em>Journal of Philosophy<\/em>, 66, pp. 829-839.<br \/>[2] Canavotto, I. (2022).\u00a0<em>Where Responsibility Takes You: Logics of Agency, Counterfactuals, and Norms<\/em>. Cham: Springer.<br \/>[3] Fischer, J. M., &amp; Ravizza, M. (1998).\u00a0<em>Responsibility and Control: A Theory of Moral Responsibility<\/em>. New York: Cambridge University Press.<\/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-e573aaf elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"e573aaf\" 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-33d0e61\" data-id=\"33d0e61\" 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-8fdb7cd elementor-widget elementor-widget-heading\" data-id=\"8fdb7cd\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2023-2024 Spring Semester<\/h3>\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-ac0c52b elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"ac0c52b\" 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-f306308\" data-id=\"f306308\" 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-fd9327b elementor-widget elementor-widget-toggle\" data-id=\"fd9327b\" 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-2651\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-2651\" 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 14:00-15.30 Penghao Du (Tsinghua University) Modal Logics of Definable Link Variations: Characterization and Satisfiability<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2651\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2651\"><p><strong>Abstract:<\/strong><\/p><p>Link variations, including link cutting, adding and rotating, are critical updating process on graphs, which play important roles in graph reasoning. Undefinable link variations and their logics have been widely studied. In [Li, 2020], Li introduced a modal logic, LLD, designed for definable link cutting. In this talk, following LLD, I will propose the logics LLA, LLR, and LLV, which respectively address definable link adding, rotating, and combinations of dynamic operations on graphs. Van Benthem-style characterization theorems for these logics will be provided. In addition, I will show that all these logics are undecidable and present decidable fragments of them.<br \/>This is a joint work with Qian Chen.<\/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-2652\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-2652\" 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 7 14:00-15.30 Feng Jiang (Tsinghua University) Generic Absoluteness for the Chang Model<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2652\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2652\"><p><strong>Abstract:<\/strong><\/p><p>This talk will give an introduction to Woodin\u2019s generic absoluteness theorem for the Chang model. In particular, we will show that if there exists a Woodin cardinal which is a limit of Woodin cardinals, then every set of reals in the Chang model is Lebesgue measurable. The proof presented here follows the approach developed in Paul Larson\u2019s book\u00a0<em>The Stationary Tower<\/em>.This is joint work with Jialiang Yan.<\/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-2653\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-2653\" 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 14:00-15.30 Mingliang Chu (Tsinghua University) Different Interpretations of Ockham\u2019s Ascent and Descent Rules<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2653\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2653\"><p><strong>Abstract:<\/strong><\/p><p>The differing views on individual terms prompt us to consider Ockham\u2019s rules of ascent and descent from various perspectives. Firstly, interpreting individual terms as elements within the domain of individuals, we see the ascent and descent rules as part of the quantification theory in first-order logic. Secondly, adopting Quine\u2019s approach, which views individual terms as a specific kind of predicate, we interpret the rules within the tradition of the Two-Classes Theory. We believe this interpretation aligns more closely with Ockham\u2019s original intent. Moreover, from this viewpoint, the ascent and descent rules closely coincide with the pattern of monotonic reasoning that represents \u2018predicate substitution\u2018. Finally, to ensure the surface syntactic structure remains unchanged, we draw upon Russell\u2019s theory of descriptions, interpreting individual terms as collections of properties. We will demonstrate that, within the framework of generalized quantifiers, the ascent and descent rules constitute a form of monotonic reasoning.<\/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-2654\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-2654\" 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 14:00-15.30 Sisi Yang (Tsinghua University) A New Semantics for Extended Argumentation Framework<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2654\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2654\"><p><strong>Abstract:<\/strong><\/p><p>The formal study of argumentation plays an important role in knowledge representation, especially in reasoning from contradictory information. Many developments build on Dung\u2019s seminal theory of argumentation. Preference is a key concept in argumentation to represent the comparative strength of arguments, and in particular can be used to resolve conflicts between arguments. It\u2019s essential for preferences to adapt to various scenarios rather than remaining fixed. Consequently, Modgil extended Dung\u2019s framework to reasoning about preferences. However, this extension led to the loss of the general existences of grounded and preferred extensions. In this talk, I will begin with an introduction to Dung\u2019s abstract argumentation framework and semantics, followed by an introduction to Modgil\u2019s extended argumentation framework and semantics. Then I will explain the limitations of Modgil\u2019s semantics. At last, I will present our new semantics based on the extended argumentation framework, which preserves the semantic properties of Dung\u2019s argumentation framework.<\/p><p>This is a joint work with Yan Zhang.\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-2655\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-2655\" 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 14:00-15.30 Wei Wang (Tsinghua University) Towards a Logical Approach to AI-Driven Recommendations<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2655\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2655\"><p><strong>Abstract:<\/strong><\/p><p>In the digital era, users encounter an endless stream of recommendations. The development of recommendation algorithms in AI has attracted extensive attention, yielding a substantial body of literature. However, the contribution of logic has been minimal. In this talk, we propose a new recommendation logic (RL) to study the reasoning behind recommendations, emphasizing their basis in users\u2019 revealed preferences. We explore the expressivity of RL by introducing a new notion of bisimulation and translating RL into a 3-variable fragment of a\u00a0two-sorted\u00a0first-order logic. We show that RL-models have the tree model property and that their model-checking problem can be solved in polynomial time, for which we propose an algorithm and prove its correctness. We believe that our approach lays a foundation for AI research and has the potential to advance personalized recommendations.<\/p><p>This is joint work with Fenrong Liu and Sisi Yang.<\/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-2656\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-2656\" 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 11 15:45-17:15 Xi Yang (Tsinghua University) Model Comparison Games for Characterization of Quantifier Number and Other Syntactic Measure<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2656\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2656\"><p><strong>Abstract:<\/strong><\/p><p>Games can serve as a tool to characterize the expressive power of logics. One example is the Ehrenfeucht-Fra\u00efss\u00e9 Games (EF-games), which capture the quantifier rank of first-order sentence required to distinguish between two structures. In my presentation, I will discuss combinatorial games that have garnered attention recently, particularly focusing on multi-structural games introduced in [1] and re-discovered in [2]. These games can capture the number of quantifiers of first-order sentences required to separate structures. I will present the findings from [3] regarding the differences between EF games and the multi-structural games. Moreover, I will discuss syntactic games introduced in [3], which can simultaneously capture reasonable syntactic measures and the number of variables of first order sentences.<\/p><p>This talk is mainly based on [3].<\/p><p><strong>References<\/strong><\/p><p>[1] Immerman, N. (1981). Number of quantifiers is better than number of tape cells.\u00a0<em>Journal of Computer and System Sciences<\/em>, 22(3), 384-406.<\/p><p>[2] Fagin, R., Lenchner, J., Regan, K. W., &amp; Vyas, N. (2021, June). Multi-structural games and number of quantifiers. In\u00a0<em>2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)<\/em>\u00a0(pp. 1-13). IEEE.<\/p><p>[3] Carmosino, M., Fagin, R., Immerman, N., Kolaitis, P., Lenchner, J., &amp; Sengupta, R. (2023). Multi-Structural Games and Beyond. arXiv preprint arXiv:2301.13329.<\/p><p>This is joint work with Fenrong Liu and Sisi Yang.<\/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-2657\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-2657\" 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 11 14:00-15.30 S\u00f8ren Knudstorp (ILLC, University of Amsterdam) Axiomatizing Step-by-Step: Lessons from Modal Information Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2657\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2657\"><p><strong>Abstract:<\/strong><\/p><p>This presentation aims to derive general heuristics and specific methods for axiomatization, the Finite Model Property (FMP) and decidability. It will encompass selected excerpts from my recent papers [Knudstorp 2023b; Knudstorp 2023a], along with unpublished work, extending my Master\u2019s thesis (https:\/\/eprints.illc.uva.nl\/id\/eprint\/2226\/1\/MoL-2022-24.text.pdf), \u2018Modal Information Logics\u2019, overseen by Johan van Benthem and Nick Bezhanishvili.<\/p><p>Modal information logics (MILs) were first proposed by Van Benthem (1996) to model a theory of information using possible-worlds semantics. Although the logics have been around for some time, not much is known: Van Benthem (2017) and Van Benthem (2019) pose two problems, namely (1) axiomatizing the two basic MILs of suprema on preorders and posets, respectively, and (2) proving (un)decidability.<\/p><p>The main results of the first part of the talk are solving these two problems: (1) by providing an axiomatization [with a completeness proof entailing the two logics to be the same], and (2) by proving decidability \u2018via completeness\u2019.<\/p><p>The second part of the talk will explore a selection of belated logical systems. Most notably, the MIL on semilattices is axiomatized with an infinite scheme and shown not to be finitely axiomatizable. Emphasis will be limited to two main aspects: the axiomatization technique employed, and the (seemingly) paradoxical increase in complexity: from the finitely axiomatizable (decidable) MILs on preorders and posets, an infinitely (and not finitely) axiomatizable (undecidable) logic arises by chaffing away most of the posets to only consider the more well-behaved ones with all binary suprema.<\/p><p>The talk will be entirely self-contained, yet attendees may find my Peking talk on April 9th to be a valuable supplement.<\/p><p><strong>References<\/strong><\/p><ul><li>Knudstorp, S\u00f8ren Brinck (2023a). \u201cLogics of truthmaker semantics: comparison, compactness and decidability\u201d. In:\u00a0<em>Synthese<\/em>\u00a0202. doi: 10.1007\/s11229-023-04401-1.\u2014 (2023b).<ul><li>\u201cModal Information Logics: Axiomatizations and Decidability\u201d. In:\u00a0<em>Journal of Philosophical Logic<\/em>\u00a052, pp. 1723\u20131766. doi: 10.1007\/s10992-023-09724-5.<\/li><\/ul><\/li><li>Van Benthem,\u00a0Johan\u00a0(1996). \u201cModal Logic as a Theory of Information\u201d. In:\u00a0<em>Logic and Reality<\/em>. Essays on the Legacy of Arthur Prior. Ed. by J. Copeland. Clarendon Press, Oxford, pp. 135\u2013168.\u2014 (Oct. 2017).<ul><li>\u201cConstructive agents\u201d. In:\u00a0<em>Indagationes Mathematicae<\/em>\u00a029. doi: 10.1016\/j.indag.2017. 10.004.\u2014 (2019). \u201cImplicit and Explicit Stances in Logic\u201d. In:\u00a0<em>Journal of Philosophical Logic<\/em>\u00a048.3, pp. 571\u2013 601. doi: 10.1007\/s10992-018-9485-y.<\/li><\/ul><\/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-2658\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-2658\" 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 14:00-15.30 Wenfei Ouyang (Tsinghua University) Co-dependence: Interactions between <R, R-1>  Bimodal Logic and LFD<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2658\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2658\"><p><strong>Abstract:<\/strong><\/p><p>This report will present a preliminary attempt to explore the logical interaction between\u00a0\u00a0Bimodal Logic and the Logic of Functional Dependence (LFD). LFD, proposed by Baltag and Van Benthem (2021), is an extension of classical propositional logic with local dependence formulas and dependence quantifiers. A relational semantics for LFD is established with dependence quantifiers treated as modalities and local dependence formulas treated as modal atoms. This is a good starting point for considering\u00a0\u00a0Bimodal Logic, an extension of standard basic modal logic with the complement\u00a0\u00a0of\u00a0, proposed by Goranko (1990). We aim to address two main questions: How will LFD behave when we extend the semantics with complemental relations? What is the significance of this interaction? In this presentation, I intend to provide preliminary answers to these questions and offer some insights and results regarding these two logics.<\/p><p>This talk mainly relies on the works of Baltag and Van Benthem (2021) and Goranko (1990).<\/p><p>[1] Baltag A, van Benthem J. A simple logic of functional dependence[J]. Journal of Philosophical Logic, 2021, 50: 939-1005.\u00a0<br \/>[2] Goranko V. Completeness and Incompleteness in the Bimodal Base L(R, -R)\u00a0[J]. Mathematical logic, 1990: 311-326.<\/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-2659\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-2659\" 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 14:00-15.30 Qingyu He (Tsinghua University) Reason-based Obligation: A Causal-Deontic Model<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-2659\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2659\"><p><strong>Abstract:<\/strong><\/p><p>Reason-based Obligation (RO) defines actions that individuals ought to perform based on specific objectives, rather than on norms or rules. These actions are performed instrumentally to fulfill these objectives. In natural language, this concept is typically expressed as \u201cin order to X, you ought to do Y\u201d. In this talk, we will extend causal models by combining the priority structure proposed by [van Benthem et al 2014] to capture the notion of RO and related reasoning. In our model, achieving the objective through an action is treated as a causal relationship between the action and the goal.<\/p><p>In addition, a similar priority-causality analysis of desire was proposed in [Xie &amp; Yan 2024]. However, in our analysis, desire is interpreted through preference ordering, while obligation is interpreted through ideal ordering, highlighting their semantic differences. Therefore, we further explore the interaction between desire and RO, especially when RO is conditional on a desire. We aim to account for both the distinctions and the interconnections between these two structures.<\/p><p>This is a joint work with Jialiang Yan.<\/p><p>Reference:<\/p><ul><li>van Benthem J, Grossi D, Liu F. Priority structures in deontic logic[J]. Theoria, 2014, 80(2): 116-152.<\/li><li>Xie K, Yan J. A logic for desire based on causal inference[J]. Journal of Logic and Computation, 2024, 34(2): 352-371.<\/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-26510\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-26510\" 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 14:00-15.30 Yiqian Wang (Tsinghua University) Presupposition Projection of Disjunction: Symmetry and Exclusivity<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-26510\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-26510\"><p><strong>Abstract:<\/strong><\/p><p>A sentence in natural language can have different types of meanings. Among them, presupposition is usually characterized by being a speaker commitment in various non-assertive environments, e.g., \u201cDid John stop smoking?\u201d still commits to \u201cJohn has smoked.\u201d One central problem for presuppositions is how do they project from simple sentences to complex sentences, through different connectives, predicates, and quantifiers. As for binary connectives, a fundamental problem that still lacks empirical verification is whether presupposition projection is symmetric. A pioneering robust experimental study has showed that it is asymmetric for conjunction (Mandelkern et al., 2020). A following study has showed that it is symmetric for disjunction (Kalomoiros &amp; Schwarz,\u00a0upcoming). However, subtle differences in K&amp;S\u2019s results seem to suggest a potential confounding factor \u2013 exclusive implicature of disjunction, which has been independently brought up to solve the proviso problem (Mayr &amp; Romoli, 2016). This talk aims to introduce relevant background on presupposition projection of disjunction (PPD) and explore the potential influence of exclusivity on the symmetry of PPD.<\/p><p>Major References:<\/p><ul><li>Kalomoiros, A., &amp; Schwarz, F. Presupposition projection from \u201cand\u201d vs \u201cor\u201d: Experimental data and theoretical implications.\u00a0<em>Journal of Semantics<\/em>.\u00a0<em>Accepted<\/em><\/li><li>Mandelkern, M., Zehr, J., Romoli, J., &amp; Schwarz, F. (2020). We\u2019ve discovered that projection across conjunction is asymmetric (and it is!).\u00a0<em>Linguistics and Philosophy<\/em>, 43(5), 473\u2013514.<\/li><li>Mayr, C., &amp; Romoli, J. (2016). Satisfied or exhaustified: An ambiguity account of the Proviso Problem.\u00a0In M. Moroney, C.-R. Little, J. Collard, &amp; D. Burgdorf (Eds.),<em>\u00a0Proceedings of the 26th Semantics and Linguistic Theory Conference\u00a0<\/em>(pp. 892\u2013912).<\/li><li>Slides and handouts in the classes of Mingming Liu and Gennaro Chierchia<\/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-26511\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-26511\" 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 14:00-15.30 Lizhu Zhang (Tsinghua University) Tableau for an Intuitionistic Probability Logic ILP<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-26511\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-26511\"><p><strong>Abstract:<\/strong><\/p><p>Intuitionistic Probability Logic ILP, which intends\u00a0to provide an intuitionistic formalization of reasoning about probability, was proposed by Angelina Ili\u0107-Stepi\u0107 et al. An objective of this presentation is to introduce the logic ILP and investigate the tableau calculus for ILP. Different from the tableau given by Zoran Ognjanovi\u0107, I will show a tableau without prefixes and with rules\u00a0applied within the probability operators.<\/p><p><br \/><strong>References<\/strong><\/p><p>[1] Angelina Ili\u0107-Stepi\u0107, Zoran Ognjanovi\u0107, and Aleksandar Perovi\u0107. \u201cThe Logic ILP for Intuitionistic Reasoning About Probability\u201d. In:\u00a0<em>Studia Logica<\/em>\u00a0(2023), pp. 1\u201331.<\/p><p>[2] Zoran Ognjanovi\u0107, Aleksandar Perovi\u0107, and Angelina Ili\u0107-Stepi\u0107. \u201cTableau for the logic ILP\u201d. In:\u00a0<em>Publications de l\u2019Institut Mathematique<\/em>\u00a0112.126 (2022), pp. 1\u201311.<\/p><p>[3] Marcello D\u2019Agostino et al.\u00a0<em>Handbook of tableau methods<\/em>. Springer Science &amp; Business Media, 2013.<\/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-26512\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-26512\" 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 23 14:00-15.30 Jiatu Li (Massachusetts Institute of Technology) Reverse Mathematics of Complexity Lower Bounds \uff08online\uff09<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-26512\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-26512\"><p><strong>Abstract:<\/strong><\/p><p>Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are necessary to prove a given theorem. In this work, we systematically explore the reverse mathematics of complexity-theoretic lower bounds. We explore reversals in the setting of bounded arithmetic. Using Cook\u2019s theory PV1 as the base theory, we show that several natural lower-bound statements about communication complexity, error-correcting codes, and Turing machines are equivalent to combinatorial principles such as the weak pigeonhole principle. Our results also yield several interesting corollaries that go against the intuition shared by some researchers in the field.<br \/>This is a joint work with Igor Oliveira (University of Warwick) and Lijie Chen (UC Berkeley).<\/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-26513\" class=\"elementor-tab-title\" data-tab=\"13\" role=\"tab\" aria-controls=\"elementor-tab-content-26513\" 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 June 06 16:00-17.30 Feng Jiang (Tsinghua University) Regularity properties of universally Baire sets<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-26513\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"13\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-26513\"><p><strong>Abstract:<\/strong><\/p><p>In this talk, we will lift various regularity properties of analytic and co-analytic sets to universally Baire sets of reals. The notion of universally Baire sets is a generalization of the analytic and co-analytic sets introduced by Feng, Magidor, and Woodin in [F-M-W 92]. In [F-M-W 92], the authors proved that the universally Baire sets have many classical regularity properties which analytic and co-analytic sets share, such as Lebesgue measurability, the Baire property, the Bernstein property, and the Ramsey property. We will continue this line of research and show that the universally Baire sets have even more regularity properties.<\/p><p><strong>Reference<\/strong>:<br \/>Qi Feng, M.Magidor, H.Woodin, Universally Baire Sets of Reals. In: H. Judah, W. Just, and W.H.Woodin, (eds)\u00a0<em>Set Theory of the Continuum<\/em>. Mathematical Sciences Research Institute Publications, vol 26. Springer, 1992.<\/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-26514\" class=\"elementor-tab-title\" data-tab=\"14\" role=\"tab\" aria-controls=\"elementor-tab-content-26514\" 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 30 14:00-15.30 Rui Fan (Tsinghua University) An Occupation Game and Its Formalization<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-26514\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"14\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-26514\"><p><strong>Abstract:<\/strong><\/p><p>Encouraged by sabotage game and Go, I design an occupation game. We have a grid with two players who can move from one square to another, and put one line on an edge of the square where they arrive. The aim is to \u2018trap\u2019 the other player inside a totally fenced-in area. Players can make a move as one step in a compass direction (no diagonal steps allowed), where points on the boundary count as unreachable. Also in a round, a player can make one point unavailable anywhere. You lose if you are hemmed in by occupied points so cannot move when it is your turn. Occupation moves really just remove some nodes form the game board, so this can be formalized with the modal logic MLSR of point removal in van Benthem et al (2020).<\/p><p><strong>Reference<\/strong>:<br \/>[1] Johan van Benthem, Krzysztof Mierzewski, and Francesca Zaffora Blando. The modal logic of stepwise removal.\u00a0<em>The Review of Symbolic Logic<\/em>, page 1\u201328, 2020.<\/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-26515\" class=\"elementor-tab-title\" data-tab=\"15\" role=\"tab\" aria-controls=\"elementor-tab-content-26515\" 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 June 06 14:00-15.30 Yichen Zhao (Tsinghua University) Exclusive Cover Modality<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-26515\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"15\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-26515\"><p><strong>Abstract:<\/strong><\/p><p>We introduce a modality called exclusive cover modality which requires the formulas in the prefixed multiset to be satisfied on distinct successors, and show that exclusive cover modal logic has exactly the same expressive power with graded modal logic (GML, with all the finitely-counting modalities). Also, by combining basic modal logic and exclusive cover modal logic, we get a logic which has the same expressive power with exclusive instantial neighborhood logic (eINL), together with some ideas on the axiomatization.<\/p><p><strong>References<br \/><\/strong>[1] De Rijke, Maarten. \u201cA note on graded modal logic.\u201d\u00a0<em>Studia Logica<\/em>\u00a064.2 (2000): 271-283.<br \/>[2] Fattorosi-Barnaba, Maurizio, and Francesco De Caro. \u201cGraded modalities. I.\u201d\u00a0<em>Studia Logica<\/em>\u00a044 (1985): 197-221.<br \/>[3]\u00a0Gao, Han. \u201cOn some variants of instantial neighborhood logic.\u201d Tsinghua University, 2022.<\/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-1fb1bb9 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"1fb1bb9\" 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-c2a86b3\" data-id=\"c2a86b3\" 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-10cb275 elementor-widget elementor-widget-heading\" data-id=\"10cb275\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2023-2024 Fall Semester<\/h3>\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-da8423c elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"da8423c\" 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-5c3409b\" data-id=\"5c3409b\" 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-637df6a elementor-widget elementor-widget-toggle\" data-id=\"637df6a\" 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-1041\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-1041\" 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 16th 14:00~15:30 Zhenkun Hu (Tsinghua University) \u300a\u8340\u5b50\u300b\u4ee5\u201c\u51e1\u201d\u5b57\u4e3a\u9996\u7684\u8fa9\u8bf4\u6a21\u5f0f\u6982\u89c8\u53ca\u5176\u63a8\u7406\u7279\u5f81<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1041\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1041\"><p><strong>Abstract:<\/strong><\/p><p>\u300a\u8340\u5b50\u300b\u4e00\u4e66\u4e2d\u5e7f\u6cdb\u5b58\u5728\u7740\u4ee5\u201c\u51e1\u201d\u5b57\u4e3a\u9996\u7684\u8fa9\u8bf4\u6a21\u5f0f\u3002\u8be5\u6a21\u5f0f\u662f\u8340\u5b50\u8bba\u8ff0\u67d0\u4e9b\u91cd\u8981\u601d\u60f3\u4e3b\u5f20\u7684\u624b\u6bb5\uff0c\u80fd\u591f\u4ece\u5168\u6587\u4e2d\u88ab\u62bd\u79bb\u51fa\u6765\u800c\u6210\u4e3a\u4e00\u4e2a\u76f8\u5bf9\u72ec\u7acb\u7684\u8fa9\u8bf4\u5355\u5143\u3002\u5b83\u5206\u522b\u7531\u201c\u51e1\u201d\u201c\u6545\u201d\u201c\u4eca\u201d\u7b49\u6807\u5fd7\u8bcd\u6240\u5f15\u9886\u7684\u53e5\u5b50\u4ee5\u53ca\u4e0e\u4e4b\u76f8\u5173\u7684\u7ec6\u5316\u8bba\u8bc1\u3001\u7ecf\u5178\u5f15\u7528\u7b49\u90e8\u5206\u7ec4\u6210\u3002\u5404\u90e8\u5206\u7684\u53e5\u5b50\u4e4b\u95f4\u6709\u7684\u53ef\u4ee5\u5f62\u6210\u8f83\u4e3a\u4e25\u683c\u7684\u903b\u8f91\u63a8\u7406\uff0c\u6709\u7684\u5219\u4e0d\u80fd\u3002\u672c\u7814\u7a76\u5c06\u5728\u5206\u6790\u8be5\u6a21\u5f0f\u7531\u7b80\u81f3\u7e41\u4e0d\u540c\u5206\u578b\u7684\u57fa\u7840\u4e0a\uff0c\u63a2\u7a76\u6a21\u5f0f\u5404\u90e8\u5206\u53e5\u5b50\u95f4\u7684\u808c\u7406\u548c\u5173\u7cfb\uff0c\u8fdb\u800c\u51c6\u786e\u628a\u63e1\u300a\u8340\u5b50\u300b\u7acb\u8bba\u3001\u8fa9\u8bf4\u6240\u4f9d\u636e\u7684\u63a8\u7406\u539f\u5219\u548c\u903b\u8f91\u89c2\u5ff5\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-1042\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-1042\" 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 16th 16:00~17:30 Qingyu He (Tsinghua University) A Deontic Logic Based on Causal Inferences<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1042\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1042\"><p><strong>Abstract:<\/strong><\/p><p>Causality plays an important role in deontic reasoning, where the actions that individuals are obligated (permitted\/forbidden) to perform are often contingent on the outcomes they bring about. This presentation explores the deontic logic with causal inferences, by proposing a causal deontic model. In this model, deontic modalities are defined in terms of causal relationships. In addition, we will discuss various deontic paradoxes and examine the dynamic aspects in this model.<br \/>This is joint work with Jialiang Yan.<\/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-1043\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-1043\" 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 14:00~15:30 Eva Henke (Institute for the History of Natural Sciences, Chinese Academy of Sciences and Department of Philosophy, Humboldt-Universit\u00e4t zu Berlin) Language and Abstraction in Liu Hui\u2019s Commentary to the Nine Chapters of Mathematical Proceduress<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1043\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1043\"><p><strong>Abstract:<\/strong><\/p><p>In contemporary mathematics, a formalized and abstract language is used to define mathematical objects and to prove general theorems. Because of the close link between language and abstraction it is instructive to explore how mathematicians from different cultures theorized about language use. In my talk I will examine the case of third-century Chinese mathematician Liu Hui. His Comment- ary to the Nine Chapters on Mathematical Procedures is deeply rooted in the philosophy of his time. I argue that to Liu Hui language has two functions in mathematics. On the one hand, language can be employed to describe a situation in a mathematically fruitful way. For example, if we want to add 1\u20442 and 1\/3, we can say instead that we add 3\/6 and 2\/6, enabling us to directly add the numerat \u2013 ors. On the other hand, language is used to make other people understand how a procedure is car- ried out and why it is correct. There can be understanding without a complete description, so the un- expressed and even inexpressible can be part of mathematical theory. In general, language is a tool to be used flexibly by the mathematician. The same situation may be described in different ways, and different situations may be described in the same way. This feature of language leads to abstract mathematical descriptions. But because understanding may go beyond words, the generality of a method does not always have to be put into abstract expressions.<\/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-1044\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-1044\" 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 21 14:00-15.30 Fengxiang Cheng (Tsinghua University) How to understand norms and permissions: a dependence logic approach<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1044\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1044\"><p><strong>Abstract:<\/strong><\/p><p>An in-depth investigation into the internal structure of norms forms our exploration of deontic concepts such as obligation, permission and prohibition. In this paper, we offer novel perspectives for comprehending how norms constrain an agent\u2019s behavior and for understanding deontic operators. First, we argue that norms should be conceptualized as constraints on multi-agent interactions across varied contexts. Within these situations, agents assume distinct roles or positions, their actions being shaped by the corresponding norm. Second, we propose that actions prescribed by norms in a given situation are related to the behaviors of others, whose roles are also directed by the norm. Third, based on the framework of LFD, we introduce a norm-induced dependence model and capture the formalization of the deontic operators of obligation, permission, and prohibition. Notably, our discussion on permission is inspired by the conditional independence operator in LFD. This is a joint work with Chenwei Shi and Jialiang Yan.<\/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-1045\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-1045\" 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 28 14:00-15.30 Martin Stokhof (The University of Amsterdam & Tsinghua University) Certainties: holism, entrenchment, changeach<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1045\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1045\"><p><strong>Abstract:<\/strong><\/p><p>The talk explores three features of Wittgensteinian certainties, viz., their holistic character, their different levels of entrenchment, and their ability to change, and discusses the challenges posed by a formalisation of the concept of certainty with these features.<\/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-4efe470 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"4efe470\" 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-0059b70\" data-id=\"0059b70\" 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-fc67084 elementor-widget elementor-widget-heading\" data-id=\"fc67084\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2022-2023 Spring Semester<\/h3>\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-7cd4474 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"7cd4474\" 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-5707f4a\" data-id=\"5707f4a\" 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-0c97aed elementor-widget elementor-widget-toggle\" data-id=\"0c97aed\" 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-1321\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-1321\" 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 23 14:00-15:30 Feng Jiang \u6c5f\u5cf0 (Tsinghua University): \u5bf9\u6bd4\u4e24\u79cd\u4f9d\u8d56\u6027\u903b\u8f91<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1321\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1321\"><p><strong>Abstract:<\/strong><\/p><p>\u5728\u903b\u8f91\u5b66\u7684\u8bf8\u591a\u5e94\u7528\u573a\u666f\u4e2d\uff0c\u53d8\u91cf\u4e4b\u95f4\u7684\u4f9d\u8d56\u6027\u662f\u4e00\u4e2a\u975e\u5e38\u666e\u904d\u7684\u73b0\u8c61\u3002\u8bb8\u591a\u903b\u8f91\u5b66\u5bb6\u63d0\u51fa\u4e86\u5404\u79cd\u4e0d\u540c\u7684\u903b\u8f91\u7cfb\u7edf\uff0c\u8bd5\u56fe\u5f62\u5f0f\u7684\u523b\u753b\u201c\u4f9d\u8d56\u6027\u201d\u8fd9\u4e00\u6982\u5ff5\uff0c\u8fd9\u5176\u4e2d\u5305\u62ecHintikka\u548cSandu\u63d0\u51fa\u7684\u72ec\u7acb\u6027\u53cb\u597d\u903b\u8f91\uff08Independence Friendly Logic\uff09\u3001V\u00e4\u00e4n\u00e4nen\u63d0\u51fa\u7684\u4f9d\u8d56\u6027\u903b\u8f91\uff08Dependence Logic\uff09\u3001Baltag\u548cvan Benthem\u63d0\u51fa\u7684\u51fd\u6570\u4f9d\u8d56\u6027\u903b\u8f91\uff08LFD\uff09\u3002\u672c\u6b21\u62a5\u544a\u5c06\u5bf9\u6bd4\u4f9d\u8d56\u6027\u903b\u8f91DL\u548c\u51fd\u6570\u4f9d\u8d56\u6027\u903b\u8f91LFD\u3002\u8fd9\u4e24\u79cd\u903b\u8f91\u662f\u975e\u5e38\u4e0d\u540c\u7684\u3002DL\u662f\u4e00\u9636\u903b\u8f91\u7684\u6269\u5f20\uff0c\u5176\u8868\u8fbe\u529b\u4e0e\u5b58\u5728\u4e8c\u9636\u903b\u8f91\uff08existential second-order logic\uff09\u7b49\u4ef7\u3002LFD\u662f\u4e00\u9636\u903b\u8f91\u7684\u4e00\u4e2a\u7247\u6bb5\u540c\u65f6\u4e5f\u662f\u4e00\u79cd\u6a21\u6001\u903b\u8f91\uff0c\u6240\u4ee5LFD\u7684\u8868\u8fbe\u529b\u662f\u76f8\u5bf9\u53d7\u9650\u7684\u3002\u5224\u5b9a\u4e00\u4e2aDL\u7684\u95ed\u516c\u5f0f\u662f\u5426\u662f\u6709\u6548\u5f0f\u662f\u975e\u5e38\u590d\u6742\u7684\uff0c\u5176\u590d\u6742\u5ea6\u4e0e\u5b8c\u6574\u7684\u4e8c\u9636\u903b\u8f91\u76f8\u5f53\uff0c\u56e0\u800c\u662f\u4e0d\u53ef\u9012\u5f52\u516c\u7406\u5316\u7684\u3002\u4f46LFD\u6709\u5b8c\u5168\u7684\u5f62\u5f0f\u6f14\u7ece\u7cfb\u7edf\u5e76\u4e14\u662f\u53ef\u5224\u5b9a\u7684\u3002DL\u662f\u4e00\u79cd\u975e\u53e4\u5178\u903b\u8f91\uff0c\u6392\u4e2d\u5f8b\u4e0d\u662fDL\u7684\u6709\u6548\u5f0f\uff0c\u4f46LFD\u662f\u53e4\u5178\u7684\u3002\u5c3d\u7ba1\u5982\u6b64\uff0cDL\u548cLFD\u4ecd\u7136\u5177\u6709\u4e00\u4e9b\u5171\u540c\u7684\u7279\u5f81\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-1322\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-1322\" 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 02 14:00-15:30 Rui Fan \u6a0a\u777f (Tsinghua University): Compare three deontic logics for rationality in games<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1322\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1322\"><p><strong>Abstract:<\/strong><\/p><p>Game Theory considers about behaviour of rational agency and their\u00a0optimal\u00a0strategies\u00a0towards their\u00a0best benefit. Deontic Logic is about\u00a0the reasoning of\u00a0normative concepts such as obligation and permission. They looks very different\u00a0seemingly. But if we consider obligation and permission respectively providing\u00a0necessary and sufficient conditions for rationality in games, then we can analyze what players ought to do in a strategic game. I will focus on three deontic logics\u00a0which\u00a0adopting the above perspective and discuss their relationships: Van Benthem\u2019s \u201cMinimal Deontic Logic\u201d, Anglberger et al.\u2019s \u201cObligation as Weakest Permission\u201d, and Trypuz and Kulicki\u2019s \u201cDeontic Boolean Action Logic\u201d.\u00a0Although MDL, OWP and DBAL embody the same core principle, MDL and OWP view different philosophical commitments regarding rational obligation and permission, and DBAL can be embedded into MDL.\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-1323\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-1323\" 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 14:00-15:30 Lizhu Zhang \u5f20\u529b\u7af9 (Tsinghua University): A study on a propositional probability logic without iterations of the probability operators<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1323\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1323\"><p><strong>Abstract:<\/strong><\/p><p>In this presentation, I will introduce an interaction between mathematical logic and probability which is a logic enriches propositional logic with a list of probability operators. As the semantics, I will introduce a class of models that combine properties of Kripke models and probabilities defined on sets of possible worlds. And the axiomatization is infinitary which contains an infinitary rule with countable many premisses and one conclusion.<\/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-1324\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-1324\" 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 14:00-15:30 Zhenkun Hu \u80e1\u632f\u5764 (Tsinghua University): \u300a\u8340\u5b50\u00b7\u5929\u8bba\u300b\u7684\u6587\u672c\u4e66\u5199\u6a21\u5f0f\u63a2\u8d5c<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1324\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1324\"><p><strong>Abstract:<\/strong><\/p><p>\u4e66\u9762\u6587\u672c\u80cc\u540e\u7684\u4e66\u5199\u6a21\u5f0f\u53cd\u5e94\u4e86\u4eba\u7c7b\u601d\u7ef4\u7684\u672c\u8d28\u89c4\u5f8b\u3002\u5728\u4e2d\u56fd\u53e4\u4ee3\uff0c\u6587\u4f53\u5b66\u7684\u8bde\u751f\u6807\u5fd7\u7740\u4eba\u4eec\u5f00\u59cb\u5bf9\u4e0d\u540c\u6587\u672c\u6240\u53cd\u6620\u51fa\u7684\u4e0d\u540c\u6a21\u5f0f\u5212\u5206\u9010\u6e10\u4ea7\u751f\u81ea\u89c9\uff0c\u5218\u52f0\u3001\u5434\u8bb7\u3001\u5f90\u5e08\u66fe\u7b49\u7406\u8bba\u5bb6\u9610\u8ff0\u4e86\u5404\u81ea\u5bf9\u4e0d\u540c\u6587\u4f53\u6a21\u5f0f\u7684\u5212\u5206\u6807\u51c6\uff0c\u4f46\u4ed6\u4eec\u7684\u7406\u8bba\u505c\u7559\u4e8e\u54f2\u5b66\u7406\u8bba\u9636\u6bb5\uff0c\u5e76\u672a\u5bf9\u67d0\u79cd\u6587\u4f53\u6587\u7ae0\u672c\u8eab\u7684\u5185\u90e8\u5f62\u5f0f\u7ed3\u6784\u505a\u8be6\u7ec6\u68b3\u7406\u3002\u897f\u65b9\u6c49\u5b66\u5bb6\u5982\u74e6\u683c\u7eb3\u3001\u9ea6\u7b1b\u3001\u803f\u5e7d\u9759\u7b49\u4eba\u540c\u6837\u53d1\u73b0\u4e86\u4e2d\u56fd\u5148\u79e6\u54f2\u5b66\u6587\u672c\u7684\u4e66\u5199\u9075\u5faa\u7740\u4e00\u5b9a\u7684\u6a21\u5f0f\uff0c\u4ed6\u4eec\u6216\u4ece\u67d0\u4e00\u6587\u672c\u5355\u5143\uff0c\u6216\u4ece\u6587\u7ae0\u6574\u4f53\u6765\u63a2\u7d22\u6587\u672c\u5185\u90e8\u7684\u5f62\u5f0f\u7ed3\u6784\u548c\u7ec4\u6210\u808c\u7406\uff0c\u4f46\u4ed6\u4eec\u7684\u7814\u7a76\u4ecd\u6709\u5f88\u591a\u5730\u65b9\u9700\u8981\u5546\u69b7\u3002\u6211\u4eec\u7684\u5de5\u4f5c\u5728\u53e4\u4eca\u4e2d\u5916\u6210\u679c\u7684\u57fa\u7840\u4e0a\uff0c\u4ee5\u300a\u8340\u5b50\u00b7\u5929\u8bba\u300b\u4f5c\u4e3a\u5207\u5165\u70b9\uff0c\u8bd5\u56fe\u5bf9\u5148\u79e6\u201c\u8bba\u8bc1\u6027\u201d\u6587\u672c\u7684\u5178\u578b\u4ee3\u8868\u300a\u8340\u5b50\u300b\u505a\u5168\u9762\u7684\u6587\u672c\u5206\u6790\uff0c\u6765\u53d1\u73b0\u5176\u6587\u672c\u5185\u90e8\u7684\u4e66\u5199\u6a21\u5f0f\u3001\u7ec4\u6210\u89c4\u5f8b\u4ee5\u53ca\u662f\u5426\u5177\u6709\u903b\u8f91\u63a8\u7406\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-1325\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-1325\" 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 14:00-15:30 Qingyu He \u4f55\u6e05\u745c (Tsinghua University): \u516c\u5171\u77e5\u8bc6\u4e0e\u51fd\u6570\u4f9d\u8d56\u903b\u8f91<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1325\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1325\"><p><strong>Abstract:<\/strong><\/p><p>\u51fd\u6570\u4f9d\u8d56\u903b\u8f91\uff08LFD\uff09\u662f\u7531Baltag\u548cvan Benthem\u63d0\u51fa\u7684\u4e00\u79cd\u523b\u753b\u4f9d\u8d56\u6027\u5173\u7cfb\u7684\u903b\u8f91\u3002LFD\u548c\u8ba4\u77e5\u903b\u8f91\u4e4b\u95f4\u6709\u7740\u7d27\u5bc6\u7684\u8054\u7cfb\uff0cLFD\u4e2d\u7684\u7b97\u5b50\u90fd\u53ef\u4ee5\u5728\u8ba4\u77e5\u903b\u8f91\u4e2d\u627e\u5230\u4e0e\u4e4b\u5bf9\u5e94\u7684\u8ba4\u77e5\u7b97\u5b50\u3002\u4f8b\u5982\uff0cLFD\u4e2d\u7684\u672c\u5730\u4f9d\u8d56\u7b97\u5b50\u5bf9\u5e94\u8ba4\u77e5\u903b\u8f91\u4e2d\u7684\u5206\u5e03\u5f0f\u77e5\u8bc6\u7b97\u5b50\u3002\u4f46\u516c\u5171\u77e5\u8bc6\u7b97\u5b50\u5728LFD\u4e2d\u5e76\u6ca1\u6709\u660e\u663e\u7684\u5bf9\u5e94\u3002\u5728\u8fd9\u6b21\u62a5\u544a\u4e2d\uff0c\u6211\u4eec\u5c06\u5c1d\u8bd5\u7ed9\u51fa\u516c\u5171\u77e5\u8bc6\u7b97\u5b50\u5728LFD\u6846\u67b6\u4e2d\u7684\u89e3\u91ca\uff0c\u5e76\u901a\u8fc7\u6dfb\u52a0\u516c\u5171\u77e5\u8bc6\u7b97\u5b50\u5bf9LFD\u7684\u8bed\u8a00\u8fdb\u884c\u6269\u5145\u3002\u6b64\u5916\uff0c\u6211\u4eec\u4f1a\u8ba8\u8bba\u6269\u5145\u540e\u7684\u8bed\u8a00\u7684\u8868\u8fbe\u529b\u95ee\u9898\u3002\u8fd9\u662f\u4e0e\u77f3\u8fb0\u5a01\u548c\u9648\u8c26\u5408\u4f5c\u7684\u5de5\u4f5c\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-1326\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-1326\" 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 14:00-15:30 Qian Chen \u9648\u8c26 (Tsinghua University): Generalized Separated Topological Spaces and its modal logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1326\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1326\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong><\/p><p>\u00a0<\/p><\/div><\/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-1327\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-1327\" 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 14:00-15:30 Fengxiang Cheng \u6210\u51e4\u7965 (Tsinghua University): A fresh perspective on norms in deontic logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1327\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1327\"><p><strong>Abstract:<\/strong>\u00a0<\/p><p>Deontic logic concerns notions such as \u201cduty\u201d, \u201cpermission\u201d, and so on according to norms. Existing works primarily focus on establishing a proper logic for these notions. Nevertheless, a proper understanding of norms is seldom pursued. \u201cWhat is a norm?\u201d \u201cHow are agents\u2019 duties and permissions derived from norms?\u201d We believe that to come to grips with the meaning of the keyword \u201cought\u201d in deontic logic, a proper understanding of these questions is unavoidable. In this talk, we confront these questions by proposing a way of understanding norms. We also make a first attempt to formalize our understanding and discuss several related issues.<\/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-1328\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-1328\" 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 13 14:00-15:30 Mingliang Chu \u50a8\u660e\u4eae (Tsinghua University): \u81ea\u7136\u903b\u8f91\u89c6\u57df\u4e0b\u5965\u5361\u59c6\u6307\u4ee3\u6a21\u5f0f\u4e2d\u7684\u4e0a\u5347\u89c4\u5219<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1328\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1328\"><p><strong>Abstract:<\/strong><\/p><p>\u6211\u4eec\u5c06\u4ee5\u4e00\u79cd\u5168\u65b0\u7684\u89c6\u89d2\u6765\u89e3\u6790\u5965\u5361\u59c6\u6307\u4ee3\u6a21\u5f0f\u4e2d\u7684\u4e0a\u5347\u89c4\u5219\u3002\u6307\u4ee3\u6a21\u5f0f\u662f\u5965\u5361\u59c6\u4eba\u79f0\u6307\u4ee3\u7406\u8bba\u4e2d\u5173\u4e8e\u666e\u901a\u547d\u9898\uff08common propositions\uff09\u548c\u5206\u7acb\u547d\u9898\uff08discrete suppositions\uff09\u4e4b\u95f4\u63a8\u7406\u5173\u7cfb\u7684\u5b50\u7406\u8bba\uff0c\u5305\u62ec\u4e0a\u5347\uff08ascent\uff09\u548c\u4e0b\u964d\uff08descent\uff09\u4e24\u4e2a\u89c4\u5219\u3002\u6307\u4ee3\u6a21\u5f0f\u7684\u7ed9\u51fa\u662f\u7528\u4e8e\u5224\u5b9a\u4e09\u79cd\u7c7b\u578b\u7684\u4eba\u79f0\u6307\u4ee3\uff1a\u786e\u5b9a\u6307\u4ee3\uff08determinate supposition\uff09\u3001\u5468\u5ef6\u6a21\u7cca\u6307\u4ee3\uff08distributed and confused supposition\uff09\u548c\u4ec5\u4ec5\u6a21\u7cca\u6307\u4ee3\uff08merely personal supposition\uff09\u3002\u4ece\u4e0a\u4e16\u7eaa\u4e94\u516d\u5341\u5e74\u4ee3\u8d77\uff0c\u5b66\u754c\u6d8c\u73b0\u51fa\u4e00\u6279\u5b66\u8005\uff0c\u5982\uff0c\u535a\u7eb3\uff08P. Boehner\uff0c1952\uff09\u3001\u5c3c\u5c14\u592b\u5987\uff08Kneale, William &amp; Martha, 1962\uff09\u3001\u9a6c\u4fee\u65af\uff08G.B. Matthews, 1964\uff0c1973\uff09\u3001\u65af\u79d1\u7279\uff08T. K. Scott, 1966\uff09\u7b49\uff0c\u5c1d\u8bd5\u7528\u73b0\u4ee3\u903b\u8f91\u5df2\u6709\u6210\u679c\u6765\u91cd\u65b0\u8be0\u91ca\u6307\u4ee3\u6a21\u5f0f\uff0c\u4f8b\u5982\uff0c\u5c06\u6307\u4ee3\u6a21\u5f0f\u89c6\u4f5c\u4e3a\u8bcd\u9879\u4e3b\u4e49\u903b\u8f91\u7684\u91cf\u5316\u7406\u8bba\uff08the quantification theory of terminist logic\uff09\u3002\u7136\u800c\uff0c\u8fd9\u4e9b\u770b\u6cd5\u4e3b\u8981\u662f\u56f4\u7ed5\u6307\u4ee3\u6a21\u5f0f\u4e2d\u7684\u4e0b\u964d\u89c4\u5219\u7ed9\u51fa\u7684\uff0c\u81f3\u4e8e\u6307\u4ee3\u6a21\u5f0f\u4e2d\u7684\u53e6\u4e00\u90e8\u5206\uff1a\u4e0a\u5347\u89c4\u5219\uff0c\u5219\u9c9c\u6709\u4eba\u95ee\u6d25\u3002\u8fd9\u91cc\uff0c\u6211\u4eec\u5c06\u501f\u52a9\u81ea\u7136\u903b\u8f91\u5355\u8c03\u63a8\u7406\u7684\u601d\u60f3\u6765\u91cd\u65b0\u89e3\u8bfb\u6307\u4ee3\u6a21\u5f0f\u4e2d\u7684\u4e0a\u5347\u89c4\u5219\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-1329\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-1329\" 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 14:00-15:30 Xuan Li \u674e\u65cb (Tsinghua University): \u200b\u91cf\u5316\u6a21\u6001\u903b\u8f91\u7814\u7a76\u4e2d\u4e2a\u4f53\u7684\u8de8\u4e16\u754c\u540c\u4e00\u95ee\u9898<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1329\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1329\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong><\/p><p>\u91cf\u5316\u6a21\u6001\u903b\u8f91\u4e2d\u6709\u4ece\u8a00\uff08de dicto\uff09\u548c\u4ece\u7269\uff08de re\uff09\u4e24\u79cd\u91cf\u5316\u6a21\u6001\u516c\u5f0f\uff0c\u800c\u5bf9\u4e8e\u5176\u4e2d\u4ece\u7269\u6a21\u6001\u516c\u5f0f\u7684\u8bed\u4e49\u63a2\u8ba8\u4e2d\u6d89\u53ca\u5230\u4e86\u4e2a\u4f53\u7684\u8de8\u4e16\u754c\u540c\u4e00\u95ee\u9898\uff0c\u5305\u62ec\u540c\u4e00\u4e2a\u4f53\u5982\u4f55\u5b58\u5728\u4e8e\u4e0d\u540c\u7684\u4e16\u754c\u4e4b\u4e2d\uff0c\u4e2a\u4f53\u4e0e\u6027\u8d28\u7684\u5173\u7cfb\u7b49\u7b49\u3002<\/p><p>\u514b\u91cc\u666e\u514b\u548c\u5927\u536b\u00b7\u5218\u6613\u65af\u5404\u81ea\u7ed9\u51fa\u4e86\u4e0d\u540c\u7684\u8bed\u4e49\u7406\u8bba\uff0c\u4f46\u662f\u90fd\u4f7f\u5f97\u4e2a\u4f53\u7684\u8de8\u4e16\u754c\u540c\u4e00\u95ee\u9898\u4ee5\u4e0d\u540c\u7684\u5f62\u5f0f\u5448\u73b0\u51fa\u6765\u3002\u827e\u4f26\u00b7\u6d77\u68ee\uff08Allen Hazen\uff09\u548c\u66fc\u5f17\u96f7\u5fb7\u00b7\u5361\u666e\u5f17\uff08Manfred Kupffer\uff09\u57fa\u4e8e\u5bf9\u5e94\u7269\u7406\u8bba\uff0c\u7ed9\u51fa\u4e86\u4e00\u79cd\u65b0\u7684\u8bed\u4e49\u523b\u753b\u3002\u57fa\u4e8e\u8fd9\u4e00\u523b\u753b\uff0c\u6211\u4eec\u63a2\u8ba8\u514b\u91cc\u666e\u514b\u548c\u5218\u6613\u65af\u7406\u8bba\u4e2d\u4ea7\u751f\u7684\u95ee\u9898\u3002<\/p><\/div><\/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-13210\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-13210\" 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 14:00-15:30 Xiaoxuan Fu \u4ed8\u5c0f\u8f69 (China University of Political Science and Law): \u200bModal Logic with Counting: Dynamic and Axiomatic Aspects<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-13210\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-13210\"><p><strong>Abstract:<\/strong>\u00a0<\/p><p>Numerical comparisons in natural language combine logical and arithmetical features. There have been many attempts to combine them with the language of first-order logic. However, the resulting logic is quite complex, so it is better to look into some small languages such as modal logic with counting ML(#) (see van Benthem &amp; Icard 2021). In this talk, I will introduce the dynamic and axiomatic aspects of ML(#) by presenting several kinds of model updates that can use reduction axioms and showing that certain PDL constructions cannot be defined in the basic ML(#). I will also discuss the axiomatization of ML(#) with respect to different frame classes, including image-finite frames and arbitrary frames.<\/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-13211\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-13211\" 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 June 1 14:00-15:30 Penghai Du \u675c\u9e4f\u660a (Tsinghua University): \u200bLogic of Link Variations<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-13211\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-13211\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong><\/p><p>In this\u00a0talk, we investigate dynamic modal operators containing cutting, adding and rotating,\u00a0which have the ability to modify the accessibility relation of a model at both local and global levels.\u00a0To begin with, we will provide motivation behind this research by exploring the connections between graph games, knowledge graphs, and social networks. We will then introduce the language and semantics used in the logic of global\/local link variations, and proceed to show the axiomatization of these logics in its hybrid version, including details about its completeness proof. Furthermore, we will present our research findings on model checking and undecidability results for these logics. Finally, we will conclude by summarizing the key insights gained from our research, and suggest questions for further exploration. This is joint work with Qian Chen.<\/p><hr class=\"wp-block-separator has-alpha-channel-opacity is-style-wide\" \/><\/div><\/div><\/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-494d2ab elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"494d2ab\" 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-b953122\" data-id=\"b953122\" 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-8c1afe7 elementor-widget elementor-widget-heading\" data-id=\"8c1afe7\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2022-2023 Autumn Semester<\/h3>\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-3b3be9a elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"3b3be9a\" 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-efb06df\" data-id=\"efb06df\" 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-0007cfe elementor-widget elementor-widget-toggle\" data-id=\"0007cfe\" 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-3191\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-3191\" 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 14:00-15:30 Zhenkun Hu \u80e1\u632f\u5764 (Tsinghua University): \u74e6\u683c\u7eb3\u8fde\u9501\u5e73\u884c\u6a21\u5f0f\uff08IPS\uff09c\u90e8\u5206\u7684\u4e0d\u540c\u8bed\u6cd5\u8868\u73b0\u53ca\u5176\u5bf9\u300a\u8340\u5b50\u300b\u8bba\u8bc1\u7814\u7a76\u7684\u542f\u793a<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3191\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3191\"><p><strong>Abstract:<\/strong> \u5fb7\u56fd\u6c49\u5b66\u5bb6\u74e6\u683c\u7eb3\u7814\u7a76\u300a\u8001\u5b50\u300b\u7684\u8fc7\u7a0b\u4e2d\u53d1\u73b0\u4e86\u4e2d\u56fd\u53e4\u4ee3\u54f2\u5b66\u6587\u672c\u5177\u6709\u8fde\u9501\u5e73\u884c\u5f0f\u7684\u8bba\u8bc1\u6a21\u5f0f\uff0c\u4ed6\u4ee5a\u3001b\u6807\u8bb0\u5e73\u884c\u7684\u6587\u672c\uff0c\u4ee5c\u6807\u8bb0\u5206\u5272\u3001\u538b\u7f29\u3001\u8054\u7ed3\u3001\u603b\u7ed3a\u3001b\u90e8\u5206\u7684\u6587\u672c\u3002\u4f46\u662fc\u90e8\u5206\u5728\u4e0d\u540c\u7684\u8bed\u4f8b\u4e2d\u5f80\u5f80\u6709\u4e0d\u540c\u7684\u8bed\u6cd5\u8868\u73b0\uff0c\u5e76\u672a\u5b8c\u6574\u5177\u5907\u4e0a\u8ff0\u529f\u80fd\u3002\u8fd9\u4e9b\u4e0d\u540c\u8868\u73b0\u76f4\u63a5\u5f71\u54cd\u4e86IPS\u7406\u8bba\u7684\u4e25\u8c28\u6027\u548c\u53ef\u884c\u6027\uff0c\u5e76\u5bf9\u8bf8\u5982\u300a\u8340\u5b50\u300b\u7b49\u8bba\u8bc1\u6027\u6587\u672c\u7684\u903b\u8f91\u3001\u63a8\u7406\u7814\u7a76\u6709\u6240\u542f\u793a\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-3192\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-3192\" 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 14:00-15:30 Qingyu He \u4f55\u6e05\u745c (Tsinghua University): From Quantity to Quality: A Logic for Combining Causality and Belief<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3192\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3192\"><p><strong>Abstract:<\/strong> Causal Bayesian network plays an important role in artificial intelligence, probability theory and many other fields. In some sense, we can view the scenarios we observed as a causal Bayesian network. Unlike traditional quantitative representation\uff0cin this paper,\u00a0we propose a qualitative representation of causal Bayesian to explore belief revision under Bayesian network. To formalize this idea, we construct a causal plausibility model by combining the plausibility model and the causal model. We develop a logic based on this model and explore properties of the logic.\u00a0(co-work with\u00a0Kaibo Xie\u00a0and\u00a0Fenrong\u00a0Liu)<\/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-3193\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-3193\" 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 06 14:00-15:30 Fengxiang Cheng \u6210\u51e4\u7965 (Tsinghua University): A Definition of Conventions by Correlated Equilibrium<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3193\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3193\"><p><strong>Abstract:<\/strong> In <em>Convention (1968)<\/em>, David Lewis makes the epistemic assumption that the agents have common knowledge of the convention to which they are parties, in the account of conventions, which is based on coordination problems. This became one of the most fecund but controversial developments he put forth in, that is, the study of the relation between common knowledge and social conventions. In my presentation, I will focus on how to define convention by correlated equilibrium according to Peter Vanderschraaf<em>(1995,1998)<\/em>. It generalizes previous game-theoretic definitions of Lewis and can be used to characterize partial conflict situations. Examples and formal definitions will be given to show how this more extensive account of convention can be applied to some game problems as well as norms of justice.<\/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-3194\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-3194\" 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 14:00-15:30 Mingliang Chu \u50a8\u660e\u4eae (Tsinghua University): \u4ee5\u7b80\u5355\u7c7b\u578b\u03bb\u6f14\u7b97\u770b\u5965\u5361\u59c6\u7684\u5347\u964d\u539f\u5219<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3194\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3194\"><p><strong>Abstract:<\/strong> \u5bf9\u4e8e\u5347\u964d\u539f\u5219\u63d0\u51fa\u7684\u76ee\u7684\uff0c\u5f53\u4ee3\u5b66\u8005\u5404\u6267\u4e00\u8bcd\u3002T.K. Scott(1966)\u8ba4\u4e3aOckham\u7684\u5347\u964d\u539f\u5219\u662f\u91cf\u8bcd\u547d\u9898\u7684\u53e5\u6cd5\u89c4\u5219\u7684\u96c6\u5408\uff0c\u662f\u552f\u540d\u8bba\u91cf\u8bcd\u7406\u8bba\u3002\u53e6\u4e00\u4e9b\u5b66\u8005\uff0c\u5982G. Priest &amp; S. Read(1977\uff0c1980)\uff0c\u5219\u8ba4\u4e3a\u5e94\u8be5\u4ece\u73b0\u4ee3\u771f\u4e4b\u7406\u8bba\u7684\u89c6\u89d2\u770b\uff0c\u4e0b\u964d\uff08\u4e0a\u5347\uff09\u5f62\u5f0f\u662f\u539f\u59cb\u53e5\u7684\u771f\u4e4b\u6761\u4ef6\u3002\u9664\u6b64\u4e4b\u5916\uff0cP. V. Spade(1988)\u7ed9\u51fa\u4e86\u4e00\u79cd\u66f4\u6fc0\u8fdb\u7684\u770b\u6cd5\uff0c\u8ba4\u4e3a\u5347\u964d\u539f\u5219\u7684\u63d0\u51fa\u662f\u65e0\u76ee\u7684\u6027\u7684\u3002\u800c\u672c\u4eba\u8ba4\u4e3a\uff0c\u5965\u5361\u59c6\u63d0\u51fa\u5347\u964d\u539f\u5219\u67d0\u79cd\u7a0b\u5ea6\u4e0a\u662f\u5bf9\u4e8e\u81ea\u7136\u8bed\u8a00\u4e2d\u6d89\u53ca\u9650\u5b9a\u8bcd\u5355\u8c03\u63a8\u7406\u7684\u4e00\u79cd\u6d1e\u89c1\u3002\u8fd9\u4e00\u60f3\u6cd5\u6e90\u81ea\u4e8eThomas F . Icard\u3001Lawrence S. Moss\u548cWilliam Tune\u5173\u4e8e\u7b80\u5355\u7c7b\u578b<em>\u03bb<\/em>\u6f14\u7b97\u7684\u6700\u65b0\u6210\u679c\uff0c\u5373\u901a\u8fc7\u5c06\u5e8f\u5173\u7cfb\u5f15\u5165\u7b80\u5355\u7c7b\u578b<em>\u03bb<\/em>\u6f14\u7b97\u6765\u5206\u6790\u81ea\u7136\u8bed\u8a00\u4e2d\u7684\u5355\u8c03\u63a8\u7406\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-3195\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-3195\" 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 14:00-15:30 Qian Chen \u9648\u8c26 (Tsinghua University): Tabularity and Post-Completeness in Tense Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3195\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3195\"><p><strong>Abstract:<\/strong> This presentation is based on the paper \u2018Tabularity and Post-Completeness in Tense Logic\u2019. A new characterization of tabularity in tense logic is established, namely, a tense logic L is tabular if and only if\u00a0 tab<sup>T<\/sup><sub>n<\/sub>\u00a0\u2208 L for some n\u22651\u00a0. Two characterization theorems for the Post-completeness in tabular tense logics are given. Furthermore, a characterization of the Post-completeness in the lattice of all tense logics is established. Post numbers of some tense logics are shown.<\/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-3196\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-3196\" 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 14:00-15:30 Yuqi Liu \u5218\u96e8\u7426 (Tsinghua University): A Formal Analysis of the Why-question of Action<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3196\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3196\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong><\/p><p>This presentation aims to provide a formal interpretation of the why-question of action, based on a preference logic scenario. Many conceptions in natural language are incorporated, including presuppositions, sentence topics, discourse topics, etc. Compared to the other wh-questions, the why-question is unique in that it requires more satisfying answers. This analysis also provides a process for producing satisfactory answers.<\/p><\/div><\/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-3197\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-3197\" 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 14:00-15:30 Kun Xing \u90a2\u951f (Anyang Normal University): A Formal Solution to the Symbol Grounding Problem in Natural Language Understanding<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3197\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3197\"><p><strong>Abstract:<\/strong> Natural Language Understanding (NLU) is a crucial problem in Artificial Intelligence (AI), and the symbolism approach to this problem lies in Formal Semantics. However, traditional theories in Formal Semantics all encounter the symbol grounding problem which prevents them successfully applying to NLU or AI. This presentation, which is based on the first part of the reporter\u2019s doctoral dissertation, aims to give a formal solution to this problem so that one could develop a formal semantic theory more applicable to NLU and 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-3198\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-3198\" 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 19:00-20:30 Tianwei Zhang \u5f20\u5929\u73ae (Technical University of Vienna): Bisimulations over Parity Formulas<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3198\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3198\"><p><strong>Abstract:<\/strong><\/p><p>This talk is an investigation into how to define the notion of bisimulation over parity formulas. We provide and argue for a list of criteria against which we could judge how good such a definition is. In general, a notion of bisimulation should be sound, closed under union and composition, easily decidable and as close to being complete as possible. It should also guarantee the existence of a largest bisimulation, namely the bisimilarity relation. Particular to the situation with parity formulas, a good bisimulation should also have a \u2019relative flavor\u2019 in its handling of the priority condition. We propose four definitions of bisimulations over parity formulas and evaluate each of them according to those criteria. We especially argue for one of the four definitions to be the best by far, since it satisfies all qualitative criteria and lies in a relatively good position onthe \u2019spectrum of completeness\u2019. We also provide an adequate bisimilarity game for this notion of bisimulation which makes it easier to work with the notion.<\/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-3199\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-3199\" 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 20 14:00-15:30 Xiaoxin Jing \u666f\u6653\u946b (Capital Normal University): Dynamic Epistemic Logic for Multi-agent Abstract Argumentation<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-3199\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-3199\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong> Argumentation has become a major research area in Artificial Intelligence over the last two decades.\u00a0Abstract argumentation is an elegant way to tackle reasoning problems in the presence of conflicting\u00a0information. The seminal paper by\u00a0Dung defines an argumentation framework as a digraph whose nodes are abstract entities called arguments, and edges are attacks representing the conflict\u00a0between these arguments.\u00a0This presentation aims to\u00a0introduce a dynamic epistemic logic for\u00a0multi-agent\u00a0abstract argumentation.<\/p><\/div><\/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-31910\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-31910\" 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 20 14:00-15:30 Yinlin Guan \u7ba1\u94f6\u9716 (Tsinghua University), Xiaoxuan Fu \u4ed8\u5c0f\u8f69 (China University of Political science and Law): The Paradox of the Dao in the Laozi<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-31910\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-31910\"><p><strong>Abstract:<\/strong> The\u00a0<em>Laozi<\/em>\u00a0starts with \u201cthe\u00a0<em>dao<\/em>\u00a0that can be spoken of is not the constant\u00a0<em>dao<\/em>\u201d. It arises a paradox where\u00a0the\u00a0<em>Laozi<\/em>\u00a0expresses the ineffability of the\u00a0<em>dao<\/em>, but also depicts what the\u00a0<em>dao<\/em>\u00a0is in the text. In this presentation, we argue that the paradox of the\u00a0<em>dao<\/em>\u00a0is a kind of Russell\u2019s paradox. We attempt to solve the paradox of the\u00a0<em>dao<\/em>\u00a0by means of solutions of Russell\u2019s paradox and see if it would further solve the interpretive issues raised by the paradox of the\u00a0<em>dao<\/em>.\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-31911\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-31911\" 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 01 14:00-15:30 Jialiang Yan \u95eb\u4f73\u4eae (Tsinghua University): Knowing and Believing an Epistemic Possibility<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-31911\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-31911\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong><\/p><p>What does it mean to know or believe that something might be the case? In this presentation, we address the issue focusing on the epistemic possibility expressed by English <em>might<\/em> when embedded under the propositional attitude verbs <em>know<\/em> and <em>believe<\/em>. We present some puzzles to highlight the challenges arising from such <em>know-might<\/em> and <em>believe-might<\/em> sentences. We propose a framework to solve the puzzles, in which epistemic might is defined as quantifying over the epistemic possibilities in an information state, and belief is formalized in term of a plausibility ordering. In contrast to the classical epistemic logic, the factivity of knowledge is treated as a presupposition rather than being solely dependent on the reflexivity of the accessibility relation. All analyses are implemented in a team-based modal logic BSEL, an epistemic variant of Aloni\u2019s (2022) BSML.<\/p><p>This is a joint work with Maria Aloni.<\/p><\/div><\/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-31912\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-31912\" 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 22 14:00-15:30 Penghao Du \u675c\u9e4f\u660a (Tsinghua University): Axiomatization of Hybrid Definable Link Deletion Logic and Hybrid Bridge Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-31912\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-31912\"><p>In the papers \u2018Losing connection: the modal logic of definable link deletion\u2019 by Dazhu Li and \u2018Relation-changing modal operators\u2019 by Carlos Areces, Raul Fervari, and Guillaume Hoffmann, the authors put forward the definable link deletion logic, bridge logic and rotation logic, and its axiomatization are open problems. In my presentation, I will introduce some motivating examples at the beginning. Then I will illustrate the language and semantics of definable link deletion logic and bridge logic. Finally, I will give the axiomatization of definable link deletion logic and bridge logic in hybrid version, and some crucial details of completeness proof. This is a joint work with Qian Chen.\u00a0<\/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-560516f elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"560516f\" 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-88682c1\" data-id=\"88682c1\" 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-b9d72b1 elementor-widget elementor-widget-heading\" data-id=\"b9d72b1\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2021-2022 Spring Semester<\/h3>\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-ec06dc6 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"ec06dc6\" 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-3a37fcf\" data-id=\"3a37fcf\" 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-8872627 elementor-widget elementor-widget-toggle\" data-id=\"8872627\" 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-1431\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-1431\" 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 14:00-15:30 Zhenkun Hu \u80e1\u632f\u5764 (Tsinghua University): \u74e6\u683c\u7eb3\u5bf9\u201c\u592b\u201d\u5728\u4e2d\u56fd\u53e4\u4ee3\u8bba\u8bc1\u6027\u6587\u672c\u4e2d\u4f5c\u7528\u7684\u7814\u7a76<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1431\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1431\"><p><strong>Abstract:<\/strong> \u8457\u540d\u6c49\u5b66\u5bb6\u74e6\u683c\u7eb3(Rudolf G. Wagner)\u5728\u300aA Building Block of Chinese Argumentation: Initial Fu\u592b as a Phrase Status Marker\u300b\u4e00\u6587\u6307\u51fa\uff0c\u4e2d\u56fd\u53e4\u4ee3\u7684\u5206\u6790\u548c\u8bba\u8bc1\u6027\u6587\u672c\u4e2d\uff0c\u5404\u79cd\u4fee\u8f9e\u53ef\u4ee5\u7528\u6765\u6807\u8bb0\u8bed\u53e5\u7684\u8eab\u4efd\u5730\u4f4d\uff0c\u5982\u679c\u7f3a\u5931\u5bf9\u8fd9\u65b9\u9762\u95ee\u9898\u7684\u7814\u7a76\uff0c\u6211\u4eec\u4fbf\u65e0\u6cd5\u51c6\u786e\u7406\u89e3\u4e2d\u56fd\u53e4\u4ee3\u7684\u8bba\u8bc1\u3002\u4e0e\u5176\u4ed6\u8bed\u8a00\u76f8\u6bd4\uff0c\u6587\u8a00\u6587\u4e2d\u4f5c\u4e3a\u8eab\u4efd\u5730\u4f4d\u6807\u8bb0\u7684\u8bcd\u6c47\u5728\u5173\u4e8e\u8bba\u8bc1\u7684\u7814\u7a76\u4e2d\u957f\u671f\u88ab\u5ffd\u89c6\u3002\u74e6\u683c\u7eb3\u8ba4\u4e3a\uff0c\u201c\u592b\u201d\u8fd9\u4e2a\u8bcd\u662f\u53e4\u4ee3\u54f2\u5b66\u6587\u672c\u4e2d\u91cd\u8981\u7684\u8bed\u53e5\u8eab\u4efd\u6807\u8bb0\uff0c\u4ed6\u4ece\u9b4f\u664b\u7384\u5b66\u6587\u672c\u5c24\u5176\u662f\u738b\u5f3c\u5bf9\u300a\u5468\u6613\u300b\u300a\u8001\u5b50\u300b\u7684\u6ce8\u91ca\u4e2d\u5bfb\u627e\u201c\u592b\u201d\u7684\u89c4\u8303\u6027\u610f\u4e49\u3002\u4ed6\u7684\u7814\u7a76\u5206\u4e3a\u4e24\u4e2a\u6b65\u9aa4\uff0c\u7b2c\u4e00\u6b65\u662f\u7528\u5b9a\u6027\u548c\u5b9a\u91cf\u65b9\u6cd5\u7814\u7a76\u5386\u53f2\u6587\u672c\u4e2d\u4e1a\u5df2\u5f62\u6210\u7684\u5173\u4e8e\u53e5\u9996\u4e4b\u201c\u592b\u201d\u7528\u6cd5\u7684\u666e\u904d\u610f\u4e49\uff0c\u7b2c\u4e8c\u6b65\u662f\u8bd5\u56fe\u523b\u753b\u51fa\u201c\u592b\u201d\u7684\u610f\u4e49\u3001\u4f7f\u7528\u5728\u5386\u53f2\u4e2d\u7684\u53d1\u5c55\u8109\u7edc\u548c\u65f6\u95f4\u7ebf\u7d22\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-1432\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-1432\" 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 14:00-15:30 Mingliang Chu \u50a8\u660e\u4eae (Tsinghua University): \u65af\u4f69\u5fb7\u5bf9\u4e2d\u4e16\u7eaa\u6307\u4ee3\u7406\u8bba\u4e2d\u201c\u4e0a\u5347\u201d\u548c\u201c\u4e0b\u964d\u201d\u95ee\u9898\u7684\u7814\u7a76<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1432\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1432\"><p><strong>Abstract:<\/strong> \u4fdd\u7f57\u00b7\u6587\u68ee\u7279\u00b7\u65af\u4f69\u5fb7\uff08Paul Vincent Spade\uff09\u5728\u2018The Logic\u00a0of Categorical: The Medieval Theory of Descent and Ascent\u2019 \u4e00\u6587\u4e2d\u57fa\u4e8e T. K. \u00a0Scott\uff081966\uff09\u5bf9\u5341\u56db\u4e16\u7eaa\u65e9\u671f\u6307\u4ee3\u7406\u8bba\u7684\u5212\u5206\uff0c\u7740\u91cd\u5c31\u7b2c\u4e8c\u79cd\u5212\u5206\uff0c\u5373\u6307\u4ee3\u6a21\u5f0f\u539f\u5219 (\u2018the doctrine of modes of supposition\u2019)\uff0c\u7ed9\u51fa\u4e86\u8bed\u4e49\u89e3\u91ca\uff0c\u8bed\u6cd5\u5b9a\u4e49\uff0c\u4ee5\u53ca\u76f8\u5e94\u7684\u63a8\u7406\u89c4\u5219\uff0c\u5e76\u5c31\u201c\u6307\u4ee3\u6a21\u5f0f\u539f\u5219\u201d\u6240\u9002\u7528\u7684\u53e5\u578b\u505a\u4e86\u4e00\u7cfb\u5217\u89c4\u5b9a\uff0c\u540c\u65f6\u501f\u52a9\u73b0\u4ee3\u903b\u8f91\u5df2\u6709\u7684\u7ed3\u679c\uff0c\u8bba\u8bc1\u4e86\u6307\u4ee3\u6a21\u5f0f\u539f\u5219\u4e2d\u5305\u542b\u7684\u4e09\u4e2a\u5185\u5b9a\u7406\u3002\u7531\u6b64\u8fdb\u4e00\u6b65\u5f97\u51fa\uff0cBurley\uff0cOckham \u548c Buridan \u8fd9\u4e09\u4f4d\u5728\u5341\u56db\u4e16\u7eaa\u6781\u5177\u5f71\u54cd\u529b\u7684\u903b\u8f91\u5b66\u5bb6\u5bf9\u4e8e\u6307\u4ee3\u6a21\u5f0f\u539f\u5219\u7684\u8bed\u6cd5\u5b9a\u4e49\u672c\u8d28\u4e0a\u662f\u4e00\u81f4\u7684\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-1433\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-1433\" 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 14:00-15:30 Qian Chen \u9648\u8c26 (Tsinghua University): Modal Language and Bounded Fragments of Predicate Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1433\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1433\"><p><strong>Abstract:<\/strong> This is a work where guarded fragment was first introduced. The aim of this work is to find natural fragments of predicate logic extending the modal one which inherit nice properties such as finite axiomatizability, Beth definability and decidability. The so-called guarded fragment enjoys nice properties.<\/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-1434\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-1434\" 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 Penghao Du \u675c\u9e4f\u660a (Tsinghua University): An introduction of the paper \u2018The Logic of Public Announcements, Common Knowledge, and Private Suspicions\u2019 <\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1434\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1434\"><p><strong>Abstract:<\/strong> In the paper \u2018The Logic of Public Announcements, Common Knowledge, and Private Suspicions\u2019 by Alexandru Baltag, Lawrence S. Moss, and Slawomir Solecki, the authors put forward a new logical system that extends the epistemic logic with dynamic modalities of actions. This system is further extended with a\u00a0notion of common knowledge. In my presentation, I will introduce various types of actions, such as public announcements, announcements to groups privately, announcements with suspicious outsiders, etc. I will illustrate their difference with a few examples. Finally, I will show some technical results from the paper.<\/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-1435\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-1435\" 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 14:00-15:30 Qingyu He \u4f55\u6e05\u745c (Tsinghua University): A Topological Perspective on Causal Inference<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1435\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1435\"><p><strong>Abstract:<\/strong> In the paper \u2018A Topological Perspective on Causal Inference\u2019 written by Duligur Ibeling and Thomas Icard, the authors put forward a general framework for topologizing spaces of causal models and characterized levels of the causal hierarchy topologically as an illustration. This work demonstrates that topologizing causal models helps clarify the scope and limits of causal inference under different assumptions. Since causal inference is the central issue for causality, I will focus on the technical results of causal inference. The proof of topological causal hierarchy theorem and some advantages of the framework will also be showed in this presentation.\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-1436\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-1436\" 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 14:00-15:30 Yuqi Liu \u5218\u96e8\u7426 (Tsinghua University): Formalizing Explanatory Dialogues<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1436\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1436\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong><\/p><p>In the paper \u2018Formalizing Explanatory Dialogues\u2019 written by Abdallah Arioua and Madalina Croitoru, the authors develop an argumentation framework based on Walton\u2019s CE system on explanatory dialogue. They define the explanation in a goal-directed dialogue system governed by a set of rules. My presentation is to introduce the two main concerns in their work: the commitment stores in the dialogue and dialectical shifts. The former guarantees the success of an explanatory dialogue and the latter aims at incorporating the explanation into a wider range of different dialogues.\u00a0<\/p><p>Ref. Arioua, M. Croitoru, Formalizing explanatory dialogues, in: International Conference on Scalable Uncertainty Management, Springer, 2015, pp. 282\u2013297<\/p><\/div><\/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-1437\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-1437\" 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 14:00-15:30 Fengxiang Cheng \u6210\u51e4\u7965 (Tsinghua University): The Problem of Logical Omniscience<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1437\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1437\"><p><strong>Abstract:<\/strong> In the paper <strong>\u2018<\/strong>The Problem of Logical Omniscience, written by Robert C. Stalnaker, the author first defends the deductive omniscience of an agent as a kind of idealization and explains why we need it. This work aims to clarify what the problem of logical omniscience is, which is discussed from the perspective of the sentence storage model and the question-answer machine respectively. In my presentation, I will introduce four different motivations of idealization and illustrate how the author attributes this problem to the concepts of knowledge and belief.<\/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-1438\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-1438\" 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 14:00-15:30 Lingyuan Ye \u53f6\u51cc\u8fdc (Tsinghua University): Towards a Unification of Semantics of Modal Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1438\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1438\"><p><strong>Abstract:<\/strong><\/p><p>In this talk, I\u2019ll introduce a new framework to provide a unifying description of different types of semantics for modal logic found in the literature and discuss their relations, using the language of topological categories. Common structures of this type include relational ones like Kripke frames, preorders, equivalence relations, etc., topological spaces, neighbourhood frames, or various other algebraic models.<\/p><p>From a philosophical perspective, the project can be viewed as giving a precise description of the \u201clandscape of information\u201d, if we identify different types of semantic models of modal logic as different ways of representing information structure. Our framework would provide a solid mathematical language to study the interplay between different information structures.<\/p><p>Form a technical perspective, we will provide a detailed study of the correspondence between the syntactical structure of (various extensions of) the modal language on one hand, and semantic structures of topological categories on the other hand, just like the way categorical logic does for first-order and higher-order theories. This \u0091is will allow us to obtain a conceptual understanding of the abstract structure of modal 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-1439\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-1439\" 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 12 14:00-15:30 Haoxuan Yin \u5c39\u660a\u8431 (Tsinghua University): A New Proof Method for Lyndon\u2019s Theorem in Variations of First-Order Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1439\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1439\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong> Lyndon\u2019s homomorphism theorem shows the equivalence between the semantic notion of monotonicity and the syntactic notion of positive occurrence. Existing proof methods either take a detour from Lyndon\u2019s interpolation theorem, or involve complicated model constructions. In this talk, we will give a new proof method that greatly simplifies the process of model construction. In some variations of first-order logic e.g. monadic first-order logic with the infinity quantifier, a sentence upward monotonic in P is equivalent to a P-positive sentence of the same depth. Therefore, we only need to consider sentences up to a certain level of distinguishability, and have a more relaxed requirement on the models that we construct. We will show our successful attempts in monadic first-order logic with the infinity quantifier and modal logic, and analyze the difficulty we face in their combination i.e. graded modal logic.<\/p><\/div><\/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-14310\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-14310\" 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 19 14:00-15:30 Haotian Tong \u7ae5\u660a\u5929 (Tsinghua University): Carnap\u2019s Problem in Intuitionistic Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-14310\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-14310\"><p><strong>Abstract:<\/strong> Carnap\u2019s problem asks whether we can uniquely fix the semantics from a given consequence relation via a reversed Tarski-Bolzano function. Here we introduce and formulate this problem and quickly recapitulate the results in propositional and first-order logic. Then we briefly review the Hilbert system and Kripke semantics of intuitionistic propositional logic (IPC) and some intermediate logics (ICs) and formalize Carnap\u2019s problem in IPC. Finally, we show much of IPC to be categorical, that is, fixed by the appropriate syntactic rules. However, implication remains elusive, so we show preliminary attempts at fixing it, including a limiting principle and the result in a logic above IPC, i.e., Dummett logic (LC).<\/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-14311\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-14311\" 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 14:00-15:30 Dazhu Li \u674e\u5927\u67f1 (Chinese Academy of Science): A Logical Analysis of Dynamic Dependence ntuitionistic Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-14311\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-14311\"><div class=\"wp-block-group\"><div class=\"wp-block-group__inner-container\"><p><strong>Abstract:<\/strong> Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. In this talk, we study temporal dependence in dynamical systems from a logical perspective, by extending a minimal modal base logic of static functional dependencies. We define a logic for dynamical systems with single time steps, provide a complete axiomatic proof calculus, and show the decidability of the satisfiability problem for a substantial fragment. The system comes in two guises: modal and first-order, that naturally complement each other. Next, we consider a timed semantics for our logic, as an intermediate between state spaces and temporal universes for the unfoldings of a dynamical system. We prove completeness and decidability by combining techniques from dynamic-epistemic logic and modal logic of functional dependencies with complex terms for objects. Also, we extend these results to the timed logic with functional symbols and term identity. Finally, we conclude with a brief outlook on how the system proposed here connects with richer temporal logics of system behavior, and with dynamic topological logic. The talk is based on recent joint work with Alexandru Baltag and Johan van Benthem.<\/p><\/div><\/div><\/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-339eb40 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"339eb40\" 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-ecff159\" data-id=\"ecff159\" 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-12bfbf9 elementor-widget elementor-widget-heading\" data-id=\"12bfbf9\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2021-2022 Autumn Semester<\/h3>\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-f3fb186 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"f3fb186\" 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-d28f606\" data-id=\"d28f606\" 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-aea5b89 elementor-widget elementor-widget-toggle\" data-id=\"aea5b89\" 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-1831\" class=\"elementor-tab-title\" data-tab=\"1\" role=\"tab\" aria-controls=\"elementor-tab-content-1831\" 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 Han Gao: Exclusively Instantial Neighborhood Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1831\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1831\"><p><strong>Abstract:<\/strong> Neighborhood semantics for modal logic is generalized in a two-sorted way in instantial neighborhood logic(INL). As a following-up work of INL, we develop another semantics for the INL language and then get exclusively instantial neighborhood logic(EINL). It is able to talk about distinct existential information in a single neighborhood, and has an expressive power strictly stronger than that of INL. We offer a Hilbert-style axiomatization of EINL, whose weak-completeness is shown by the technique of extended normal form. Finite model property and decidability for EINL are obtained as well. This is a joint work with Dazhu Li and Junhua Yu.<\/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-1832\" class=\"elementor-tab-title\" data-tab=\"2\" role=\"tab\" aria-controls=\"elementor-tab-content-1832\" 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-16 Qingyu He: From Covariation to Causation: A causal Power Theory<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1832\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1832\"><p><strong>Abstract:<\/strong> The two dominant approaches to the psychology of causal induction\u2014the covariation approach\u00a0and the causal power approach\u2014are each crippled by fundamental problems. This talk will introduce P.W. Cheng\u2019s article which proposes an integration of these approaches that overcomes these problems. The proposal is that reasoners\u00a0innately treat the relation between covariation and causal power as that between scientists\u2019 law or model and their theory\u00a0explaining the model. This solution is formalized in the power PC theory, a causal power theory of\u00a0the probabilistic contrast model.<\/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-1833\" class=\"elementor-tab-title\" data-tab=\"3\" role=\"tab\" aria-controls=\"elementor-tab-content-1833\" 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 Qian Chen: Lattices of Finitely Alternative Normal Tense Logics<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1833\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1833\"><p><strong>Abstract:<\/strong> A finitely alternative normal tense logic <em>T<sub>n,m<\/sub><\/em> is a normal tense logic characterized by frames in which every point has at most <em>n<\/em> future alternatives and <em>m<\/em> past alternatives. The structure of the lattice \u039b(<em>T<sub>1,1<\/sub><\/em>) is described. There are \u2135<sub>0<\/sub> logics in \u039b(<em>T<sub>1,1<\/sub><\/em>) without the finite model property (FMP), and only one pretabular logic in \u039b(<em>T<sub>1,1<\/sub><\/em>). There are 2<sup>\u2135<sub>0<\/sub><\/sup> logics in \u039b(<em>T<sub>1,1<\/sub><\/em>) which are not finitely axiomatizable. For nm\u2265 2, there are 2<sup>\u2135<sub>0<\/sub><\/sup> logics in \u039b(<em>T<sub>n,m<\/sub><\/em>) without the FMP, and infinitely many pretabular extensions of <em>T<sub>n,m<\/sub><\/em>.<\/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-1834\" class=\"elementor-tab-title\" data-tab=\"4\" role=\"tab\" aria-controls=\"elementor-tab-content-1834\" 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-02 Yuqi Liu: Towards a Better Theory of Why-Interrogatives: An attempt to a modified logic of interrogations<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1834\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1834\"><p><strong>Abstract:<\/strong> Various kinds of interrogative sentences play an essential role in natural language and the study of them is an intersection area of linguistics, logic and philosophy. However, there are relatively less works with respect to why-interrogatives. In this proposal, I will give an informal sketch of the difficulties of the study of why-interrogatives from semantic and pragmatic perspectives. And then I will introduce several semantic formulations and logics of interrogation to see if it is possible to give an explanation of why-interrogatives in a formal way.\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-1835\" class=\"elementor-tab-title\" data-tab=\"5\" role=\"tab\" aria-controls=\"elementor-tab-content-1835\" 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 Penghao Du: \u4f50\u4f0a\u00b7\u514b\u91cc\u65af\u6258\u5f17\uff08Zo\u00e9 Christoff\uff09\u548c\u8a79\u65af\u00b7\u4e4c\u5229\u514b\u00b7\u6c49\u68ee\uff08Jens Ulrik Hansen\uff09\u7684\u2018\u793e\u4ea4\u7f51\u7edc\u4e2d\u6269\u6563\u73b0\u8c61\u7684\u903b\u8f91\u6846\u67b6\u2019\u4ecb\u7ecd<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1835\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1835\"><p><strong>Abstract:<\/strong> \u8fd9\u7bc7\u6587\u7ae0\u4ecb\u7ecd\u4e86\u4e00\u4e2a\u63a8\u7406\u793e\u4ea4\u7f51\u7edc\u5185\u90e8\u6269\u6563\u8fc7\u7a0b\u7684\u4e00\u822c\u903b\u8f91\u6846\u67b6\u3002\u65b0\u7684\u201c\u793e\u4ea4\u7f51\u7edc\u4e2d\u5173\u4e8e\u6269\u6563\u7684\u903b\u8f91\u201d\u662f\u6807\u51c6\u6df7\u5408\u903b\u8f91\u7684\u52a8\u6001\u6269\u5f20\uff0c\u5e76\u4e14\u5728\u6a21\u578b\u4e2d\u53ef\u4ee5\u5305\u542b\u4e3b\u4f53\u7684\u591a\u4e2a\u6027\u8d28\u3002\u4f5c\u8005\u4e3a\u8fd9\u4e00\u903b\u8f91\u7684\u9759\u6001\u8bed\u8a00\u548c\u52a8\u6001\u8bed\u8a00\u5206\u522b\u63d0\u4f9b\u4e86\u5b8c\u6574\u7684\u516c\u7406\u5316\uff0c\u5e76\u5728\u5177\u4f53\u4f8b\u5b50\u4e2d\u5c55\u793a\u4e86\u5982\u4f55\u5c06\u8be5\u6846\u67b6\u5e94\u7528\u4e8e\u5177\u4f53\u793e\u4ea4\u7f51\u7edc\u7684\u6269\u6563\u73b0\u8c61\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-1836\" class=\"elementor-tab-title\" data-tab=\"6\" role=\"tab\" aria-controls=\"elementor-tab-content-1836\" 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 Xuan Li: \u5f17\u96f7\u683c\u5bf9\u6db5\u4e49\u548c\u6307\u79f0\u7684\u533a\u5206<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1836\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1836\"><div class=\"wp-block-group\">\n<div class=\"wp-block-group__inner-container\">\n<p><strong>Abstract:<\/strong> \u5728\u300a\u8bba\u6db5\u4e49\u548c\u6307\u79f0\u300b\u8fd9\u7bc7\u6587\u7ae0\u4e2d\uff0c\u4ece\u5bf9\u4e00\u4e2a\u7591\u96be\u7684\u5904\u7406\u51fa\u53d1\uff0c\u5f17\u96f7\u683c\u533a\u5206\u4e86\u4e13\u540d\u7684\u6db5\u4e49\u548c\u6307\u79f0\u3002\u8fdb\u4e00\u6b65\uff0c\u5f17\u96f7\u683c\u5bf9\u8fd9\u4e00\u533a\u5206\u8fdb\u884c\u7684\u63a8\u5e7f\uff0c\u8ba4\u4e3a\u8bed\u8a00\u4e2d\u7684\u5176\u4ed6\u7c7b\u578b\u8868\u8fbe\u5f0f\u4e5f\u6709\u8fd9\u4e00\u533a\u5206\u3002\u672c\u6b21\u62a5\u544a\u5206\u4e3a\u4e24\u90e8\u5206\uff0c\u9996\u5148\u8003\u5bdf\u8fd9\u4e00\u533a\u5206\u7684\u7531\u6765\uff0c\u4ee5\u53ca\u5728\u4e13\u540d\u4e0a\u7684\u5177\u4f53\u5448\u73b0\uff0c\u4ee5\u53ca\u5b8c\u6574\u76f4\u9648\u53e5\u8fd9\u4e00\u7279\u6b8a\u4e13\u540d\u3002\u5176\u6b21\uff0c\u63a2\u8ba8\u8fd9\u4e00\u533a\u5206\u5728\u8c13\u8bcd\u4e0a\u4f55\u4ee5\u5b9e\u73b0\uff0c\u5c24\u5176\u5982\u4f55\u7406\u89e3\u8c13\u8bcd\u7684\u6307\u79f0\u2014\u2014\u6982\u5ff5\u3002<\/p>\n<\/div>\n<\/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-1837\" class=\"elementor-tab-title\" data-tab=\"7\" role=\"tab\" aria-controls=\"elementor-tab-content-1837\" 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 Huan Yu: \u4ece\u5f17\u96f7\u683c-\u7f57\u7d20\u533a\u5206\u770b\u201c\u662f\u201d\u5728\u73b0\u4ee3\u903b\u8f91\u4e2d\u7684\u89e3\u91ca<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1837\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1837\"><p><strong>Abstract:<\/strong> \u201c\u662f\u201d\u4f5c\u4e3a\u5728\u4f20\u7edf\u4e9a\u91cc\u58eb\u591a\u5fb7\u903b\u8f91\u548c\u4e2d\u4e16\u7eaa\u8bcd\u9879\u903b\u8f91\u4e2d\u90fd\u975e\u5e38\u91cd\u8981\u7684\u903b\u8f91\u5e38\u9879\uff0c\u5728\u73b0\u4ee3\u903b\u8f91\u4e2d\u5374\u5931\u53bb\u4e86\u5b83\u7684\u4e2d\u5fc3\u5730\u4f4d\uff0c\u5176\u4e2d\u539f\u56e0\u53ef\u80fd\u4e0e\u73b0\u4ee3\u903b\u8f91\u5bf9\u53e5\u5b50\u7684\u5212\u5206\u4e0e\u4f20\u7edf\u903b\u8f91\u4e4b\u95f4\u6709\u7740\u672c\u8d28\u7684\u5dee\u5f02\u6709\u5173\u3002\u8fd9\u79cd\u4f20\u7edf\u903b\u8f91\u4e0e\u73b0\u4ee3\u903b\u8f91\u4e4b\u95f4\u7684\u5dee\u5f02\uff0c\u6070\u597d\u53ef\u4ee5\u901a\u8fc7\u5f17\u96f7\u683c\u4ee5\u53ca\u7f57\u7d20\u7b49\u73b0\u4ee3\u903b\u8f91\u7684\u521b\u59cb\u4eba\u5bf9\u5305\u542b\u201c\u662f\u201d\u7684\u547d\u9898\u6240\u4f5c\u7684\u903b\u8f91\u533a\u5206\u770b\u5f97\u5341\u5206\u6e05\u695a\u3002\u672c\u6b21\u62a5\u544a\u4ee5\u6240\u8c13\u7684\u5f17\u96f7\u683c-\u7f57\u7d20\u533a\u5206\u4e3a\u51fa\u53d1\u70b9\uff0c\u63a2\u8ba8\u5728\u73b0\u4ee3\u903b\u8f91\u4e2d\uff0c\u6211\u4eec\u8be5\u5982\u4f55\u5bf9\u201c\u662f\u201d\u6709\u4e00\u4e2a\u6e05\u6670\u7684\u628a\u63e1\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-1838\" class=\"elementor-tab-title\" data-tab=\"8\" role=\"tab\" aria-controls=\"elementor-tab-content-1838\" 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 Lei Li: Distributed Game Logic<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1838\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1838\"><p><strong>Abstract:<\/strong> The idea of distributed games comes from distributed systems, which are often used in computer science to describe the combination of parallel processes. There are several mechanisms to provide operational models for distributed systems by means of transition systems. We provide a logical characterization of distributed systems reflecting the handshaking mechanism. Furthermore, we try to explore knowledge and strategies from the perspective of games.<\/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-1839\" class=\"elementor-tab-title\" data-tab=\"9\" role=\"tab\" aria-controls=\"elementor-tab-content-1839\" 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 Mingliang Chu: \u4ece\u300a\u903b\u8f91\u5b66\u5bfc\u8bba\u300b\u770b\u5a01\u5ec9\u00b7\u820d\u4f0d\u5fb7\u7684\u6307\u4ee3\u7406\u8bba<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-1839\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1839\"><div class=\"wp-block-group\">\n<div class=\"wp-block-group__inner-container\">\n<p><strong>Abstract:<\/strong> \u5a01\u5ec9\u2022\u820d\u4f0d\u5fb7\u7684\u300a\u903b\u8f91\u5b66\u5bfc\u8bba\u300b\uff08Introductiones in logicam\uff09\u662f\u4e2d\u4e16\u7eaa\u665a\u671f\u65b0\u5f0f\u903b\u8f91\uff08logica moderna\uff09\u65f6\u671f\u6700\u65e9\u7684\u5b8c\u6574\u8457\u4f5c\uff0c\u8be5\u4e66\u4e2d\u5173\u4e8e\u8bcd\u9879\u7279\u6027\u7684\u5206\u6790\u4e0e\u5176\u53e6\u4e00\u672c\u8457\u4f5c\u300a\u52a9\u8303\u7574\u8bcd\u300b\uff08syncategoremata\uff09\u5173\u4e8e\u52a9\u8303\u7574\u8bcd\u7684\u8bba\u8ff0\u5960\u5b9a\u4e86\u65b0\u5f0f\u903b\u8f91\u53d1\u5c55\u521d\u671f\u7684\u4e24\u4e2a\u4e3b\u8981\u7814\u7a76\u8def\u5f84\uff1a\u8bcd\u9879\u7279\u6027\u548c\u52a9\u8303\u7574\u8bcd\uff0c\u800c\u5bf9\u540e\u8005\u7684\u7814\u7a76\u53c8\u662f\u4ee5\u524d\u8005\u4e3a\u7406\u8bba\u57fa\u7840\u3002\u820d\u4f0d\u5fb7\u5c06\u8bcd\u9879\u7279\u6027\u5206\u4e3a\uff1a\u610f\u8c13\u7279\u6027\uff08signification\uff09\uff0c\u6307\u4ee3\u7279\u6027\uff08supposition\uff09\uff0c\u8fde\u63a5\u7279\u6027\uff08copulation\uff09\u548c\u79f0\u547c\u7279\u6027\uff08appellation\uff09\uff0c\u5176\u4e2d\u6307\u4ee3\u7279\u6027\u662f\u820d\u4f0d\u5fb7\u6700\u4e3a\u5173\u6ce8\u7684\u90e8\u5206\uff0c\u800c\u7531\u6b64\u5efa\u6784\u8d77\u6765\u7684\u6307\u4ee3\u7406\u8bba\u53ef\u4ee5\u8bf4\u662f\u820d\u4f0d\u5fb7\u8bcd\u9879\u7279\u6027\u7406\u8bba\u7684\u6838\u5fc3\u3002\u5373\u4fbf\u662f\u66f4\u5e7f\u4e3a\u4eba\u77e5\u7684\u5a01\u5ec9\u2022\u5965\u5361\u59c6\u7684\u6307\u4ee3\u7406\u8bba\uff0c\u5176\u7406\u8bba\u57fa\u7840\u4e5f\u8981\u8ffd\u8ff0\u5230\u820d\u4f0d\u5fb7\u7684\u601d\u60f3\u3002\u56e0\u6b64\uff0c\u65e0\u8bba\u662f\u4ece\u7aa5\u63a2\u5a01\u5ec9\u2022\u820d\u4f0d\u5fb7\u6574\u4e2a\u7406\u8bba\u67b6\u6784\uff0c\u8fd8\u662f\u4ece\u4e2d\u4e16\u7eaa\u665a\u671f\u903b\u8f91\u5b66\u601d\u60f3\u53f2\u7684\u89d2\u5ea6\uff0c\u5398\u6e05\u5a01\u5ec9\u2022\u820d\u4f0d\u5fb7\u7684\u6307\u4ee3\u7406\u8bba\u90fd\u662f\u9996\u8981\u4e4b\u9009\u3002<\/p>\n<\/div>\n<\/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-18310\" class=\"elementor-tab-title\" data-tab=\"10\" role=\"tab\" aria-controls=\"elementor-tab-content-18310\" 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 Zhenkun Hu: \u4ece\u300a\u5341\u529b\u8bed\u8981\u300b\u770b\u718a\u5341\u529b\u5bf9\u903b\u8f91\u4e0e\u4e2d\u56fd\u54f2\u5b66\u5173\u7cfb\u7684\u8ba4\u8bc6<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-18310\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"10\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-18310\"><p><strong>Abstract:<\/strong> \u300a\u5341\u529b\u8bed\u8981\u300b\u5377\u4e8c\u4e2d\uff0c\u718a\u5341\u529b\u5728\u7ed9\u610f\u5927\u5229\u5b66\u8005\u9a6c\u683c\u91cc\u5c3c\u7684\u4e66\u4fe1\u91cc\u8c08\u8bba\u4e2d\u56fd\u54f2\u5b66\u7684\u601d\u60f3\u7279\u70b9\u65f6\uff0c\u5c06\u201c\u903b\u8f91\u201d\u4f5c\u4e3a\u7406\u89e3\u4e2d\u534e\u6587\u660e\u7279\u8d28\u548c\u4e1c\u897f\u6587\u5316\u5dee\u5f02\u7684\u4e00\u4e2a\u91cd\u8981\u5207\u5165\u70b9\u3002\u718a\u5341\u529b\u5728\u4fe1\u4e2d\u8bf4\uff1a\u201c\u4e2d\u56fd\u54f2\u5b66\u4ee5\u91cd\u4f53\u8ba4\u4e4b\u6545\uff0c\u4e0d\u4e8b\u903b\u8f91\uff0c\u5176\u89c1\u4e4b\u8457\u8ff0\u8005\u4ea6\u65e0\u7cfb\u7edf\u3002\u201d\u8fd9\u53e5\u8bdd\u4f53\u73b0\u4e86\u718a\u5341\u529b\u7684\u903b\u8f91\u89c2\u4ee5\u53ca\u5bf9\u903b\u8f91\u4e0e\u4e2d\u56fd\u54f2\u5b66\u5173\u7cfb\u7684\u57fa\u672c\u8ba4\u8bc6\u3002\u6211\u4eec\u53ef\u4ee5\u901a\u8fc7\u718a\u5341\u529b\u5bf9\u903b\u8f91\u7684\u5173\u6ce8\uff0c\u8fdb\u4e00\u6b65\u4e86\u89e3\u6c11\u56fd\u65f6\u671f\u7684\u6587\u5316\u601d\u6f6e\uff0c\u6df1\u5165\u63a2\u7a76\u903b\u8f91\u80cc\u540e\u7684\u6587\u5316\u73b0\u8c61\u53ca\u5176\u4e0e\u4e2d\u534e\u6587\u5316\u7684\u878d\u5408\u78b0\u649e\uff0c\u5e76\u4e3a\u601d\u8003\u65b0\u65f6\u4ee3\u4e2d\u534e\u6587\u5316\u53d1\u5c55\u65b9\u5411\u5960\u5b9a\u57fa\u7840\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-18311\" class=\"elementor-tab-title\" data-tab=\"11\" role=\"tab\" aria-controls=\"elementor-tab-content-18311\" 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-07 Huanfang Dong: Philosophy of The Curve Fitting Problem I \u2013 Basic Solutions<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-18311\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"11\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-18311\"><div class=\"wp-block-group\">\n<div class=\"wp-block-group__inner-container\">\n<p><strong>Abstract:<\/strong> The curve fitting problem is on finding the curve that best fits a number of data points. The philosophical interest mainly lies in justifying trade-off of simplicity and goodness-of-fit. Several solutions have been proposed based on different concepts, like Akaike\u2019s Information criterion, Bayesian information criterion, and Bayes\u2019s theorem criterion etc. In this talk I will present some basic solutions and compare them.<\/p>\n<\/div>\n<\/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-18312\" class=\"elementor-tab-title\" data-tab=\"12\" role=\"tab\" aria-controls=\"elementor-tab-content-18312\" 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 Yang Sun: \u5e8f\u63d0\u5347\u548c\u9053\u4e49\u903b\u8f91<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-18312\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"12\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-18312\"><p><strong>Abstract:<\/strong> \u5e8f\u63d0\u5347\u662f\u4ece\u4e00\u4e2a\u7ed9\u5b9a\u96c6\u5408\u4e0a\u7684\u5e8f\u5173\u7cfb\uff0c\u63d0\u5347\u5230\u8be5\u96c6\u5408\u5e42\u96c6\u4e0a\u5e8f\u5173\u7cfb\u7684\u8fc7\u7a0b\u3002\u57c3\u683c\u5229-\u7c73\u6b27\u7eb3\u5e8f\u662f\u4e00\u79cd\u5e8f\u63d0\u5347\u7684\u65b9\u5f0f\u3002\u7ed9\u5b9a\u4e00\u4e2a\u96c6\u5408\u7684\u524d\u5e8f\uff0c\u53ef\u4ee5\u5bf9\u5b83\u7684\u57c3\u683c\u5229-\u7c73\u6b27\u7eb3\u5e8f\u8fdb\u884c\u516c\u7406\u5316\u3002\u8fdb\u800c\uff0c\u8003\u8651\u4e00\u4e2a\u4e25\u683c\u7248\u672c\u7684\u57c3\u683c\u5229-\u7c73\u6b27\u7eb3\u5e8f\uff0c\u5b83\u53ef\u4ee5\u4e0e\u57fa\u4e8e\u4f18\u5148\u6a21\u578b\u7684\u6761\u4ef6\u53e5\u8bed\u4e49\u8054\u7cfb\u8d77\u6765\u3002\u975e\u5355\u8c03\u6027\u5728\u9053\u4e49\u63a8\u7406\u662f\u5e38\u89c1\u7684\u3002\u4e25\u683c\u7684\u57c3\u683c\u5229-\u7c73\u6b27\u7eb3\u5e8f\u5b9a\u4e49\u51fa\u7684\u6761\u4ef6\u7b97\u5b50\u7684\u7279\u6027\uff0c\u4f7f\u5f97\u5b83\u53ef\u4ee5\u88ab\u89e3\u91ca\u4e3a\u201c\u6761\u4ef6\u5e94\u8be5\u201d\uff0c\u4ece\u800c\u5904\u7406\u4e00\u4e9b\u9053\u4e49\u6096\u8bba\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-18313\" class=\"elementor-tab-title\" data-tab=\"13\" role=\"tab\" aria-controls=\"elementor-tab-content-18313\" 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 Zhiqiang Sun: \u201c\u4f94\u5f0f\u63a8\u7406\u201d\u65b0\u8be0<\/a>\n\t\t\t\t\t<\/div>\n\n\t\t\t\t\t<div id=\"elementor-tab-content-18313\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"13\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-18313\"><p><strong>Abstract:<\/strong> \u201c\u4f94\u201d\u662f\u58a8\u5bb6\u201c\u8f9f\u3001\u4f94\u3001\u63f4\u3001\u63a8\u201d\u56db\u79cd\u8bba\u8bc1\u5f62\u5f0f\u4e4b\u4e00\uff0c\u51fa\u81ea\u300a\u58a8\u7ecf\u00b7\u5c0f\u53d6\u300b\u7bc7\u3002\u300a\u5c0f\u53d6\u300b\u5728\u8bba\u8ff0\u201c\u4f94\u201d\u65f6\uff0c\u63d0\u51fa\u4e86\u8bf8\u591a\u6096\u8bba\uff0c\u6bd4\u5982\u201c\u83b7\uff0c\u4eba\u4e5f\uff1b\u7231\u83b7\uff0c\u7231\u4eba\u4e5f\u201d\uff1b\u201c\u5176\u5f1f\uff0c\u7f8e\u4eba\u4e5f\uff0c\u7231\u5f1f\uff0c\u975e\u7231\u7f8e\u4eba\u4e5f\u201d\u3002\u524d\u8005\u63a8\u8bba\u6709\u6548\u7684\u539f\u56e0\uff0c\u4e0e\u9690\u85cf\u5728\u52a8\u5bbe\u77ed\u8bed\u4e2d\u7684\u5b58\u5728\u91cf\u8bcd\u6709\u5173\uff0c\u5176\u5e95\u5c42\u7684\u903b\u8f91\u63a8\u8bba\u5f62\u5f0f\u4e3a\u53f3\u4fa7\u5411\u4e0a\u5355\u8c03\u63a8\u7406\u3002\u800c\u540e\u8005\u7684\u8c2c\u8bef\u6210\u56e0\uff0c\u5219\u662f\u7531\u4e8e\u52a8\u5bbe\u77ed\u8bed\u4e2d\u4f4d\u4e8e\u5bbe\u9879\u4f4d\u7f6e\u7684\u91cf\u8bcd\u4e3a\u5168\u79f0\u91cf\u8bcd\uff0c\u5b83\u4f1a\u4e3a\u52a8\u5bbe\u77ed\u8bed\u63d0\u4f9b\u5355\u8c03\u5411\u4e0b\u7684\u63a8\u7406\u73af\u5883\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-34bce86 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"34bce86\" 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-a33a47c\" data-id=\"a33a47c\" 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-720f3a0 elementor-widget elementor-widget-spacer\" data-id=\"720f3a0\" 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\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-4820e2c elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"4820e2c\" 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-8546246\" data-id=\"8546246\" 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-3b15d5b elementor-widget elementor-widget-heading\" data-id=\"3b15d5b\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sessions in 2020-2021 Spring Semester<\/h3>\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-2d5ecf0 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"2d5ecf0\" 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-e8ea373\" data-id=\"e8ea373\" 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-f056b60 elementor-widget elementor-widget-text-editor\" data-id=\"f056b60\" 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>\n<li>Peng Cui \u5d14\u9e4f\u00a0<\/li>\n<li>Ke Deng \u9093\u67ef\u00a0<\/li>\n<li>Yang Sun \u5b59\u6d0b: Deontic logic as founded on nonmonotonic logic<\/li>\n<li>Yuqi Liu \u5218\u96e8\u7426: Epistemology without Knowledge and Belief<\/li>\n<li>Lingyuan Ye \u53f6\u51cc\u8fdc: Uniformity, Contingency, and Self-reference in arithmetic<\/li>\n<li>Lei Li \u674e\u78ca: On link deletion and point deletion in games on graphs\u00a0<\/li>\n<li>Xiao Li: Towards a semantic concept of aboutness: a proposal<\/li>\n<li>Mingliang Chu: \u4e2d\u4e16\u7eaa\u903b\u8f91\u5b66<\/li>\n<li>Kaibo Xie \u8c22\u51ef\u535a: \u5173\u4e8e\u7814\u7a76\u65b9\u5411\u9009\u62e9\u7684\u4e00\u4e9b\u60f3\u6cd5<\/li>\n<li>Gengjun Yao \u59da\u5e9a\u541b: \u5f53\u4f20\u64ad\u5b66\u906d\u9047\u6570\u7406\u903b\u8f91<\/li>\n<li>Huanfang Dong \u8463\u7115\u9632: Basics of Recommendation Systems\u00a0<\/li>\n<li>Chi Gao \u9ad8\u9a70:\u00a0\u65f6\u5e8f\u77e5\u8bc6\u56fe\u8c31\u7684\u53ef\u89e3\u91ca\u9884\u6d4b<\/li>\n<\/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>Sessions in 2024-2025 Fall Semester 2024 September 12 1 [&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\/4228"}],"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=4228"}],"version-history":[{"count":27,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/4228\/revisions"}],"predecessor-version":[{"id":7921,"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/4228\/revisions\/7921"}],"wp:attachment":[{"href":"http:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/media?parent=4228"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}