From 1eb7d642f6b3f981e9459dd1691790788ca5049b Mon Sep 17 00:00:00 2001
From: Dilsat <105071245+dbyuksel@users.noreply.github.com>
Date: Mon, 2 Dec 2024 17:18:58 +0000
Subject: [PATCH] Clemens' talk

---
 _101.json | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/_101.json b/_101.json
index 7c21ad6..2edda76 100644
--- a/_101.json
+++ b/_101.json
@@ -18,8 +18,8 @@
     "speakerurl": "",
     "institute": "MSP",
     "insturl": "",
-    "title": "Parity graphs",
-    "abstract": "TBD",
+    "title": "Parity Formulas",
+    "abstract": "In this talk, I will discuss how modal mu-formulas can be succinctly represented as graphs, thus avoiding some of the variable naming issues that Sean sketched in his recent 101. A key technical problem when switching to graphs is that the natural dependency order between fixpoint operators is obfuscated. Therefore our graphs need to be equipped with a parity function that encodes this order. We call the resulting graphs with parity functions <q>parity formulas</q>. This is based on joint work with Johannes Marti and Yde Venema.",
     "location": "LT210 and Online",
     "material":  []
   },