{"batchcomplete":"","continue":{"lecontinue":"20261012080503|23997","continue":"-||"},"query":{"logevents":[{"logid":24007,"ns":6,"title":"Datei:Ruleml26-eflp.pdf","pageid":17413,"logpage":17413,"revid":45225,"params":{},"type":"create","action":"create","user":"Pascal Kettmann","timestamp":"2026-10-13T09:33:42Z","comment":""},{"logid":24006,"ns":6,"title":"Datei:Ruleml26-eflp.pdf","pageid":17413,"logpage":17413,"revid":45225,"params":{"img_sha1":"8amm733af4vgq0ggy4bvr42p6b4k9uy","img_timestamp":"2026-10-13T09:33:42Z"},"type":"upload","action":"upload","user":"Pascal Kettmann","timestamp":"2026-10-13T09:33:42Z","comment":""},{"logid":24005,"ns":6,"title":"Datei:KG2026-Lecture-01-print.pdf","pageid":17408,"logpage":17408,"revid":45224,"params":{"img_sha1":"ls9vkb9vxt12ooimfo4hd7uf0jtigvx","img_timestamp":"2026-10-13T09:09:30Z"},"type":"upload","action":"overwrite","user":"Markus Kr\u00f6tzsch","timestamp":"2026-10-13T09:09:30Z","comment":""},{"logid":24004,"ns":6,"title":"Datei:KG2026-Lecture-01-overlay.pdf","pageid":17407,"logpage":17407,"revid":45223,"params":{"img_sha1":"kg0vqf9ng3fjmuetvxzpbbw6ea1zbq1","img_timestamp":"2026-10-13T09:09:21Z"},"type":"upload","action":"overwrite","user":"Markus Kr\u00f6tzsch","timestamp":"2026-10-13T09:09:21Z","comment":""},{"logid":24003,"ns":0,"title":"Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High/en","pageid":17412,"logpage":0,"revid":45222,"params":{},"type":"create","action":"create","user":"92.206.122.4","anon":"","timestamp":"2026-10-13T08:58:47Z","comment":"Page created automatically by parser function on page [[Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High]]"},{"logid":24002,"ns":0,"title":"Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High","pageid":17411,"logpage":17411,"revid":45221,"params":{},"type":"create","action":"create","user":"Nils K\u00fcchenmeister","timestamp":"2026-10-13T08:58:47Z","comment":"Die Seite wurde neu angelegt: \u201e{{Veranstaltung |Titel EN=Smallest Synchronizing Terms over Constant Alphabets Can Be Exponentially High |Veranstaltungsart=Vortrag |Start=2027-01-21 11:00:00 |Ende=2027-01-21 12:00:00 |Raum=APB 3027 |Vortragender=Luisa Herrmann |Forschungsgruppe=Computational Logic |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}\u201c"},{"logid":24001,"ns":0,"title":"A Guided Tour of Sequent Formalisms for Modal Logics/en","pageid":17410,"logpage":0,"revid":45220,"params":{},"type":"create","action":"create","user":"141.76.29.166","anon":"","timestamp":"2026-10-12T14:39:47Z","comment":"Page created automatically by parser function on page [[A Guided Tour of Sequent Formalisms for Modal Logics]]"},{"logid":24000,"ns":0,"title":"A Guided Tour of Sequent Formalisms for Modal Logics","pageid":17409,"logpage":17409,"revid":45219,"params":{},"type":"create","action":"create","user":"Nils K\u00fcchenmeister","timestamp":"2026-10-12T14:39:47Z","comment":"Die Seite wurde neu angelegt: \u201e{{Veranstaltung |Titel EN=A Guided Tour of Sequent Formalisms for Modal Logics |Beschreibung EN=This tutorial explores the landscape of sequent-based proof formalisms for modal logics, using G\u00f6del-L\u00f6b provability logic (GL) as a running example. We survey four major paradigms--labeled sequents, nested (or tree) sequents, linear nested sequents, and Gentzen sequents--and discuss the various trade-offs of choosing one formalism over another, including seq\u2026\u201c"},{"logid":23999,"ns":6,"title":"Datei:KG2026-Lecture-01-print.pdf","pageid":17408,"logpage":17408,"revid":45217,"params":{},"type":"create","action":"create","user":"Markus Kr\u00f6tzsch","timestamp":"2026-10-12T08:05:11Z","comment":""},{"logid":23998,"ns":6,"title":"Datei:KG2026-Lecture-01-print.pdf","pageid":17408,"logpage":17408,"revid":45217,"params":{"img_sha1":"re946yj1eai0dph7cbjjixz3mcv2r72","img_timestamp":"2026-10-12T08:05:11Z"},"type":"upload","action":"upload","user":"Markus Kr\u00f6tzsch","timestamp":"2026-10-12T08:05:11Z","comment":""}]}}