{"id":3713,"date":"2019-02-14T14:27:38","date_gmt":"2019-02-14T13:27:38","guid":{"rendered":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/?p=3713"},"modified":"2019-03-03T09:02:15","modified_gmt":"2019-03-03T08:02:15","slug":"lira-session-bahareh-afshari","status":"publish","type":"post","link":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/2019\/02\/lira-session-bahareh-afshari\/","title":{"rendered":"LIRa Session: Bahareh Afshari"},"content":{"rendered":"<p>Speaker:\u00a0<a href=\"http:\/\/www.cse.chalmers.se\/~bahafs\/\">Bahareh Afshari<\/a> (ILLC)<\/p>\n<p>Date and Time: Thursday, March&nbsp;14th 2019, 16:30-18:00<\/p>\n<p>Venue: ILLC Seminar Room F1.15, Science Park 107.<\/p>\n<p><strong>Title: An infinitary treatment of fixed point modal logic.<\/strong><\/p>\n<p><em>Abstract.<\/em> Fixed point modal logic deals with the concepts of induction and recursion in a most fundamental way. The term refers to any logic built on the foundation of modal logic that features inductively and\/or co-inductively defined operators. Examples range from simple temporal logics (e.g. Tense Logic and Linear Time Logic) to the highly expressive Modal Mu-Calculus and its extensions.<\/p>\n<p>In this talk I will introduce the modal mu-calculus and present a complete proof system for it based on nested sequents. We will see how the proof system can be used to obtain a proof of the finite model property and, time permitting, I will also explain how the framework lends itself to a sound and complete axiomatisation for the extension of mu-calculus with backward modalities.<\/p>\n<div>(Joint work with Gerhard J\u00e4ger and Graham Leigh)<\/div>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker:\u00a0Bahareh Afshari (ILLC)<br \/>\nDate and Time: Thursday, March&nbsp;14th 2019, 16:30-18:00<br \/>\nVenue: ILLC Seminar Room F1.15, Science Park 107.<br \/>\nTitle: An infinitary treatment of fixed point modal logic.<br \/>\nAbstract. Fixed point modal logic deals with the concepts of induction and recursion in a most fundamental way. The term refers to any logic built on the foundation of modal logic that [&#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-3713","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\/3713","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=3713"}],"version-history":[{"count":4,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3713\/revisions"}],"predecessor-version":[{"id":3760,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/3713\/revisions\/3760"}],"wp:attachment":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/media?parent=3713"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/categories?post=3713"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/tags?post=3713"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}