{"id":3964,"date":"2020-01-23T19:47:22","date_gmt":"2020-01-23T18:47:22","guid":{"rendered":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/?p=3964"},"modified":"2020-02-07T08:29:34","modified_gmt":"2020-02-07T07:29:34","slug":"lira-session-declan-thompson","status":"publish","type":"post","link":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/2020\/01\/lira-session-declan-thompson\/","title":{"rendered":"LIRa session: Declan Thompson"},"content":{"rendered":"<p>Speaker: Declan Thompson<\/p>\n<p>Date and Time: Thursday, February&nbsp;13th 2020, 16:30-18:00<\/p>\n<p>Venue: ILLC Seminar Room F1.15, Science Park 107.<\/p>\n<p><strong>Title: Local Fact Change, Memory Logic and Expressive Power<\/strong><\/p>\n<p><em>Abstract.\u00a0<\/em><\/p>\n<p style=\"font-weight: 400;\">Local fact change logic (LFC) models the notion of a unilateral change in a network structure. It adds a single, innocent-looking model change operator to the basic modal logic, allowing the valuation at a single point in the model to change. This small addition results in undecidability, which can quickly be shown via a satisfaction-preserving translation from memory logic (ML). The lack of a direct translation raises the question of the relative expressive power of LFC and ML.<\/p>\n<p style=\"font-weight: 400;\">In this talk, I will investigate the relative expressive power of LFC and ML. Such comparisons are often made by either providing a direct translation from one logic to the other, or demonstrating a pair of models which one of the logics can distinguish and the other cannot. In the case of LFC and ML, these two approaches come apart. We are left with a somewhat messy picture of how the two compare.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker: Declan Thompson<br \/>\nDate and Time: Thursday, February&nbsp;13th 2020, 16:30-18:00<br \/>\nVenue: ILLC Seminar Room F1.15, Science Park 107.<br \/>\nTitle: Local Fact Change, Memory Logic and Expressive Power<br \/>\nAbstract.\u00a0<br \/>\nLocal fact change logic (LFC) models the notion of a unilateral change in a network structure. It adds a single, innocent-looking model change operator to the basic modal logic, allowing the valuation [&#8230;]<\/p>\n","protected":false},"author":14,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4],"tags":[],"class_list":["post-3964","post","type-post","status-publish","format-standard","hentry","category-events"],"_links":{"self":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3964","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\/14"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/comments?post=3964"}],"version-history":[{"count":2,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3964\/revisions"}],"predecessor-version":[{"id":3969,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3964\/revisions\/3969"}],"wp:attachment":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/media?parent=3964"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/categories?post=3964"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/tags?post=3964"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}