ILLC-LIRa February 2023

illc-lira@list.uva.nl

1 participants
8 discussions

LIRa session: Søren Knudstorp (tomorrow, Thursday, 23 February 16:30)
by LIRa Seminar 22 Feb '23

22 Feb '23

Dear all, We will have our next LIRa session tomorrow, on Thursday, 23 February 16:30. This will be a hybrid session. If you want to attend online, please use our recurring zoom link: https://uva-live.zoom.us/j/89230639823?pwd=YWJuSnJmTDhXcWhmd1ZkeG5zb0o5UT09 (Meeting ID: 892 3063 9823, Passcode: 421723) You can find the details of the talk below. Speaker: Søren Knudstorp (ILLC, University of Amsterdam) Date and Time: Thursday, February 23rd 2023, 16:30-18:00 Venue: ILLC seminar room F1.15 in Science Park 107 and online. Title: Modal Information Logics: Axiomatizations and Decidability Abstract. In this talk, I will be presenting results from my Master of Logic thesis “Modal Information Logics”, supervised by Johan van Benthem and Nick Bezhanishvili. The thesis studies formal properties of a family of so-called modal information logics (MILs) — modal logics first proposed in van Benthem (1996) as a way of using possible-worlds semantics to model a theory of information. They do so by extending the language of propositional logic with a binary modality defined in terms of being the supremum of two states. Although MILs have been around for some time, not much is known: van Benthem (2017, 2019) pose two problems, namely (1) axiomatizing the two basic MILs of suprema on preorders and posets, respectively, and (2) proving (un)decidability. 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. These results are then build upon to axiomatize and prove decidable the MILs attained by endowing the language with an ‘informational implication’—in doing so a link is also made to the work of Buszkowski (2021) on the Lambek Calculus. Broadening the study, the basic MIL of suprema on join-semilattices is axiomatized with an infinite scheme. This constitutes the by far most substantive part of the thesis, hence we will only be lending an informal focus to accenting key ideas. Finally, if time allows, we will comment on the connection between truthmaker semantics and MILs and extend the (compactness and) decidabilit results in Fine and Jago (2019), chiefly via defining and proving a truthmaker analogue of the FMP. Hope to see you there! The LIRa team

1 0

LIRa session: Søren Knudstorp (Thursday, 23 February 16:30)
by LIRa Seminar 17 Feb '23

17 Feb '23

Dear all, We will have our next LIRa session on Thursday, 23 February 16:30. This will be a hybrid session. If you want to attend online, please use our recurring zoom link: https://uva-live.zoom.us/j/89230639823?pwd=YWJuSnJmTDhXcWhmd1ZkeG5zb0o5UT09 (Meeting ID: 892 3063 9823, Passcode: 421723) You can find the details of the talk below. Speaker: Søren Knudstorp (ILLC, University of Amsterdam) Date and Time: Thursday, February 23rd 2023, 16:30-18:00 Venue: ILLC seminar room F1.15 in Science Park 107 and online. Title: Modal Information Logics: Axiomatizations and Decidability Abstract. In this talk, I will be presenting results from my Master of Logic thesis “Modal Information Logics”, supervised by Johan van Benthem and Nick Bezhanishvili. The thesis studies formal properties of a family of so-called modal information logics (MILs) — modal logics first proposed in van Benthem (1996) as a way of using possible-worlds semantics to model a theory of information. They do so by extending the language of propositional logic with a binary modality defined in terms of being the supremum of two states. Although MILs have been around for some time, not much is known: van Benthem (2017, 2019) pose two problems, namely (1) axiomatizing the two basic MILs of suprema on preorders and posets, respectively, and (2) proving (un)decidability. 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. These results are then build upon to axiomatize and prove decidable the MILs attained by endowing the language with an ‘informational implication’—in doing so a link is also made to the work of Buszkowski (2021) on the Lambek Calculus. Broadening the study, the basic MIL of suprema on join-semilattices is axiomatized with an infinite scheme. This constitutes the by far most substantive part of the thesis, hence we will only be lending an informal focus to accenting key ideas. Finally, if time allows, we will comment on the connection between truthmaker semantics and MILs and extend the (compactness and) decidabilit results in Fine and Jago (2019), chiefly via defining and proving a truthmaker analogue of the FMP. Hope to see you there! The LIRa team

1 0

LIRa session: Jos Baeten (tomorrow, Thursday, 16 February 16:30)
by LIRa Seminar 15 Feb '23

15 Feb '23

Dear all, We will have our next LIRa session tomorrow, on Thursday, 16 February 16:30. This will be a hybrid session. If you want to attend online, please use our recurring zoom link: https://uva-live.zoom.us/j/89230639823?pwd=YWJuSnJmTDhXcWhmd1ZkeG5zb0o5UT09 (Meeting ID: 892 3063 9823, Passcode: 421723) You can find the details of the talk below. Speaker: Jos Baeten (CWI) Date and Time: Thursday, February 16th 2023, 16:30-18:00 Venue: ILLC seminar room F1.15 in Science Park 107 and online. Title: Pushdown Automata and Context-Free Grammars in Bisimulation Semantics Abstract. The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive Turing Machine, transitions have labels to give a notion of interactivity. In the resulting process graph, we use bisimilarity instead of language equivalence. Subsequently, we considered other classical theorems and notions from automata theory and formal languages theory. In this talk, we consider the classical theorem of the correspondence between pushdown automata and context-free grammars. By changing the process operator of sequential composition to a sequencing operator with intermediate acceptance, we get a better correspondence in our setting. We find that the missing ingredient to recover the full correspondence is the addition of a notion of state awareness. Hope to see you there! The LIRa team

1 0

Call for papers TbiLLC 2023: Fourteenth International Tbilisi Symposium on Logic, Language and Computation
by LIRa Seminar 13 Feb '23

13 Feb '23

Dear followers of the LIRa seminar, Our next session will be on Thursday and a reminder will follow. In the meantime we draw your attention to the following call for papers. kind regards, The LIRa team THE FOURTEENTH INTERNATIONAL TBILISI SYMPOSIUM ON LOGIC, LANGUAGE AND COMPUTATION 18-22 September, 2023 Telavi, Georgia https://events.illc.uva.nl/Tbilisi/Tbilisi2023/ *********************************************************************** FIRST CALL FOR PAPERS The Fourteenth International Tbilisi Symposium on Logic, Language, and Computation will be held 18-22 September 2023 in Telavi, located in the Kakheti region, Georgia, north-east of Tbilisi. The Programme Committee invites submissions for contributions on all aspects of logic, language, and computation. Work of an interdisciplinary nature is particularly welcome. Areas of interest include, but are not limited to: * Natural language syntax, semantics, and pragmatics * Linguistic typology and semantic universals * Language evolution and learnability * Variability in language * Sociolinguistics * Historical linguistics, history of logic * Natural logic, inference and entailment in natural language * Natural language processing * Distributional and probabilistic models of information, meaning and computation * Logic, games, and formal pragmatics * Logic and cognition * Logics for artificial intelligence and computer science * Knowledge representation * Foundations of machine learning * Formal models of multiagent systems * Logics for social networks * Logics for knowledge, belief, and information dynamics * Computational social choice * Information retrieval, query answer systems * Constructive, intuitionistic, modal and other non-classical logics * Algebraic and coalgebraic logic and semantics * Categorical logic * Models of computation PROGRAMME The programme will include the following tutorials and a series of invited lecturers. *Tutorial speakers* Language: Peter Sutton (UPF, Barcelona) Logic & Computation: Frank Wolter (University of Liverpool) *Invited speakers* Language: - Heather Burnett (CNRS-LLF, Paris) - Stephanie Solt (ZAS, Berlin) Logic & Computation: - Balder ten Cate (University of Amsterdam) - Nina Gierasimczuk (Danish Technical University) WORKSHOPS There will be two workshops embedded in the conference programme: "The Semantics of Hidden Meanings" Organisers: Heather Burnett (CNRS-LLF, Paris), Stephanie Solt (ZAS, Berlin), Peter Sutton (UPF, Barcelona) For more details see the workshop webpage: https://sites.google.com/view/hidden-meanings and "Learning and Logic" Organisers: Balder ten Cate (University of Amsterdam) and Aybüke Özgün (University of Amsterdam). More details will soon be made available via the TbiLLC website (see top). PROGRAMME COMMITTEE Samson Abramsky (University College London, UK) Philippe Balbiani (CNRS & University of Toulouse, FR) Guram Bezhanishvili (New Mexico State University, USA) Nick Bezhanishvili (University of Amsterdam, NL) Olga Borik (Universidad Nacional de Educación a Distancia, ES) Zoé Christoff (University of Groningen, NL) Agata Ciabattoni (TU Wien, AT) Milica Denić (Tel Aviv University, IL) David Gabelaia (Javakhishvili Tbilisi State University, GE) Berit Gehrke (Humboldt-Universität zu Berlin, DE, co-chair) Jim de Groot (Australian National University, AU) Helle Hvid Hansen (University of Groningen, NL, co-chair) Daniel Hole (University of Stuttgart, DE) Rosalie Iemhoff (Utrecht University, NL) Maarten Janssen (Charles University, Prague, CZ) Clemens Kupke (University of Strathclyde, UK) Temur Kutsia (Johannes Kepler University Linz, AT) Mora Maldonado (CNRS & University of Nantes, FR) Louise McNally (Universitat Pompeu Fabra, Barcelona, ES) Lawrence Moss (Indiana University, USA) Aybüke Özgün (University of Amsterdam, NL) Mehrnoosh Sadrzadeh (University College London, UK) Viola Schmitt (Humboldt-Universität zu Berlin, DE) Todd Snider (Heinrich Heine University of Düsseldorf, DE) Ana Sokolova (University of Salzburg, AT) Luca Spada (University of Salerno, IT) Yasutada Sudo (University College London, UK) Jakub Szymanik (University of Trento, IT) Carla Umbach (University of Cologne, DE) Marcin Wągiel (Masaryk University, Brno, CZ, and University of Wrocław, PL) Fan Yang (Utrecht University, NL) Malte Zimmermann (University of Potsdam, DE) Sarah Zobel (University of Oslo, NO) IMPORTANT DATES Submission deadline: Fri 17 March 2023 Notification: Wed 24 May 2023 Final abstracts due: Mon 26 June 2023 Early Registration deadline: Fri 30 June 2023 Late Registration deadline: Mon 24 July 2023 Symposium: 18-22 September 2023 SUBMISSION INFO Authors can submit an abstract for presentation at the symposium of up to 3 pages excluding references, and max 4 pages including references. Abstracts should report on original, unpublished work. All accepted abstracts will be compiled into an informal proceedings volume which will be made available electronically in advance of the symposium. PUBLICATION INFORMATION After the symposium, authors of accepted abstracts will be invited to submit a full-length paper to the post-proceedings of the symposium, which will be published in the LNCS series of Springer. The full-length submissions will undergo a new single-blind peer review process.

1 0

LIRa session: Jos Baeten (Thursday, 16 February 16:30)
by LIRa Seminar 10 Feb '23

10 Feb '23

Dear all, We will have our next LIRa session on Thursday, 16 February 16:30. This will be a hybrid session. If you want to attend online, please use our recurring zoom link: https://uva-live.zoom.us/j/89230639823?pwd=YWJuSnJmTDhXcWhmd1ZkeG5zb0o5UT09 (Meeting ID: 892 3063 9823, Passcode: 421723) You can find the details of the talk below. Speaker: Jos Baeten (CWI) Date and Time: Thursday, February 16th 2023, 16:30-18:00 Venue: ILLC seminar room F1.15 in Science Park 107 and online. Title: Pushdown Automata and Context-Free Grammars in Bisimulation Semantics Abstract. The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive Turing Machine, transitions have labels to give a notion of interactivity. In the resulting process graph, we use bisimilarity instead of language equivalence. Subsequently, we considered other classical theorems and notions from automata theory and formal languages theory. In this talk, we consider the classical theorem of the correspondence between pushdown automata and context-free grammars. By changing the process operator of sequential composition to a sequencing operator with intermediate acceptance, we get a better correspondence in our setting. We find that the missing ingredient to recover the full correspondence is the addition of a notion of state awareness. Hope to see you there! The LIRa team

1 0

Cancellation: No LIRa this week.
by LIRa Seminar 07 Feb '23

07 Feb '23

Dear all, Unfortunately the LIRa session this Thursday 9 February is cancelled. The talk by Erman Acar has been rescheduled to a later date. Our next session will be on Thursday 16 February with Jos Baeten. kind regards, The LIRa team

1 0

LIRa session: Erman Acar (Thursday, 9 February 16:30)
by LIRa Seminar 03 Feb '23

03 Feb '23

Dear all, We will have our next LIRa session on Thursday, 9 February 16:30. This will be a hybrid session. If you want to attend online, please use our recurring zoom link: https://uva-live.zoom.us/j/89230639823?pwd=YWJuSnJmTDhXcWhmd1ZkeG5zb0o5UT09 (Meeting ID: 892 3063 9823, Passcode: 421723) You can find the details of the talk below. Speaker: Erman Acar (ILLC & IvI, University of Amsterdam) Date and Time: Thursday, February 9th 2023, 16:30-18:00 Venue: ILLC seminar room F1.15 in Science Park 107 and online. Title: A Canvas on Integrating Learning & Reasoning Abstract. Integrating learning and reasoning is one of the major current challenges in AI research, and becoming more frequently pronounced under the name called "neuro-symbolic AI". Logic definitely has an important part in this research direction. In this talk, I will give a brief summary about the field, and the state of the art, as well as my work including differentiable logics, and methods on embedding the background logic. I will also outline some of the pitfalls and the current challenges in making the logical inference a part of the new learning algorithms. Hope to see you there! The LIRa team

1 0

LIRa session: Jialiang Yan (tomorrow, Thursday, 2 February 14:00) (UNUSUAL TIME and ONLINE ONLY)
by LIRa Seminar 01 Feb '23

01 Feb '23

Dear all, We will have our next LIRa session tomorrow, on Thursday, 2 February. Please note the UNUSUAL TIME of 14:00 (Amsterdam time) and that this will be an ONLINE ONLY session. Please use our recurring zoom link: https://uva-live.zoom.us/j/89230639823?pwd=YWJuSnJmTDhXcWhmd1ZkeG5zb0o5UT09 (Meeting ID: 892 3063 9823, Passcode: 421723) You can find the details of the talk below. Speaker: Jialiang Yan Date and Time: Thursday, February 2nd 2023, 14:00-15:30 (NOTE the unusual time, earlier than usual) Venue: fully online. (i.e. not hybrid) Title: Knowing and believing an epistemic possibility Abstract. What does it mean to know or believe that something might be the case? In this talk, we address the issue focusing on the epistemic possibility expressed by English might when embedded under the propositional attitude verbs know and believe. We present some puzzles to highlight the challenges arising from such know-might and believe-might 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’s (2022) BSML. Hope to see you there! The LIRa team

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

ILLC-LIRa February 2023