| Time | Session | |
|---|---|---|
| 10:30 — 10:40 | — Grand opening — | |
| 10:40 — 11:10 | Get to know each other | |
| 11:10 — 11:15 | — 5 minute Break — | |
| 11:15 — 11:50 | Elaine Pimentel: Inclusive logic: less talk, more action! | |
| 11:50 — 11:55 | — 5 minute Break — | |
| 11:55 — 12:30 | Liron Cohen: Introduction to cyclic proofs | |
| 12:30 — 13:30 | — Lunch Break — | |
| 13:30 — 14:05 | Shaull Almagor: How I Prepare a Talk (about Determinization of OCNs) | |
| 14:05 — 14:10 | — 5 minute Break — | |
| 14:10 — 14:45 | Dmitry Chistikov: Demystifying problem solving | |
| 14:45 — 14:50 | — 5 minute Break — | |
| 14:50 — 15:25 | Michał Pilipczuk: Logic meets graph theory and algorithm design | |
| 15:25 — 15:35 | — 10 minute Break — | |
| 15:35 — 16:10 | Daniele Nantes: Equations are everywhere! From ancient mathematics to modern computing | |
| 16:10 — 16:15 | — 5 minute Break — | |
| 16:15 — 16:50 | Monica VanDieren: Defining a Path Beyond First Order Model Theory | |
| 16:50 — 17:00 | — 10 minute Break — | |
| 17:00 — 18:15 | Panel with Isolde Adler, Andrew Kent, Cláudia Nalon and Standa Živný | |
| 18:15 — 18:20 | — Closing remarks — | |
Elaine Pimentel: Inclusive logic: less talk, more action! slides
We logicians are proud to say that logic is at a beautiful intersection of areas like Mathematics, Philosophy, AI, Linguistics and Computing. But we forget that this is actually an "outcast" line of research in all these areas. We have little voice and almost no recognition.
Added to this, there is the underrepresentation within the underrepresentation: the lack of common diversity in various areas of knowledge is not different in logic. In this talk, we will discuss a bit about the (lack of) representativeness of/in logic. The goal is to present a broad and positive vision of how we can be bigger and better.
Liron Cohen: Introduction to cyclic proofs slides
Cyclic proofs offer an exciting alternative to explicit induction that has proven extremely successful for intuitively capturing inductive reasoning. While standard proof systems employ explicit induction rules, cyclic systems allow for proofs with circular arguments (of a certain form), in a way that captures the essence of an inductive argument *without* explicit induction rules. This talk will provide a brief introduction to cyclic proof theory, and present several interesting open research questions in the field.
Shaull Almagor: How I Prepare a Talk (about Determinization of OCNs) slides
I will talk about my approach to preparing and giving a talk, with a talk about determinization of OCNs as a case in point.
Dmitry Chistikov: Demystifying problem solving slides
...or not really. I will share several observations and
experiences related to solving problems (mostly research problems). The
talk will also include thoughts and advice that I have heard from others
and found useful.
Michał Pilipczuk: Logic meets graph theory and algorithm design slides
We will give a very brief introduction to the area of model-checking various kinds of logic on various kinds of graphs. The main focus will be on the interplay between the expressive power of the considered logic and the structural properties of the considered graphs. On a more meta level, this will be about how knowledge and experience from very different areas come together in sometimes quite surprising ways.
Daniele Nantes: Equations are everywhere! From ancient mathematics to modern computing slides
Solving equations is not only important in pure mathematics, but also physics, engineering, biology, computer science, comoutational logic, etc. In this talk I will show how solving equations is heavily used in Computer Science, such as in theorem-provers, automatic reasoning, machine learning, analysis of cryptographic protocols and so on.
Monica VanDieren: Defining a Path Beyond First Order Model Theory slides
There has been extensive work examining both finite and infinite models through the lens of first order logic. However, the limited expressive power of first order logic motivates investigations into extensions of first order logic. In this talk I will contrast syntactic extensions of first order logics with a semantic approach first introduced by Saharon Shelah as abstract elementary classes, and later distilled to tame abstract elementary classes. While telling the story of the discovery of tame abstract elementary classes, I will share how I discovered and defined my own career path as a logician.
| Data Protection | Imprint |