{"id":3719,"date":"2019-02-18T08:56:29","date_gmt":"2019-02-18T07:56:29","guid":{"rendered":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/?p=3719"},"modified":"2019-03-29T09:03:00","modified_gmt":"2019-03-29T08:03:00","slug":"lira-session-malvin-gattinger","status":"publish","type":"post","link":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/2019\/02\/lira-session-malvin-gattinger\/","title":{"rendered":"LIRa Session: Malvin Gattinger"},"content":{"rendered":"<p>Speaker: <a href=\"https:\/\/malv.in\">Malvin Gattinger<\/a> (University of Groningen)<\/p>\n<p>Date and Time: Thursday, April&nbsp;4th 2019, 16:30-18:00<\/p>\n<p>Venue: ILLC Seminar Room F1.15, Science Park 107.<\/p>\n<p><strong>Title: Adding Boolean Definitions to Public Announcement Logic.<\/strong><\/p>\n<p>Abstract. In standard epistemic logic, knowing p means to know that p is true, not saying anything about understanding p. In this talk I will present joint work with Yanjing Wang where we extend PAL to address this limitation.<\/p>\n<p>We define the meaning of propositions with boolean formulas and add an operator for `equivalence by definition&#8217; to the language. We can then model agents with different knowledge or belief about both the truth value and the meaning of propositions. For example, an agent may understand a proposition without knowing its truth value or the other way round. Moreover, multiple agents might agree that something is true without agreeing on its meaning and vice versa.<\/p>\n<p>The talk will include various examples and a sketch of the completeness proof. It should be accessible to everyone with some background in epistemic logic.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker: Malvin Gattinger (University of Groningen)<br \/>\nDate and Time: Thursday, April&nbsp;4th 2019, 16:30-18:00<br \/>\nVenue: ILLC Seminar Room F1.15, Science Park 107.<br \/>\nTitle: Adding Boolean Definitions to Public Announcement Logic.<br \/>\nAbstract. In standard epistemic logic, knowing p means to know that p is true, not saying anything about understanding p. In this talk I will present joint work with Yanjing [&#8230;]<\/p>\n","protected":false},"author":12,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14,4],"tags":[],"class_list":["post-3719","post","type-post","status-publish","format-standard","hentry","category-all","category-events"],"_links":{"self":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3719","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/users\/12"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/comments?post=3719"}],"version-history":[{"count":5,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3719\/revisions"}],"predecessor-version":[{"id":3784,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3719\/revisions\/3784"}],"wp:attachment":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/media?parent=3719"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/categories?post=3719"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/tags?post=3719"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}