default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd CSL 2025: Amsterdam, The Netherlands
- Jörg Endrullis
, Sylvain Schmitz:
33rd EACSL Annual Conference on Computer Science Logic, CSL 2025, February 10-14, 2025, Amsterdam, Netherlands. LIPIcs 326, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-362-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Maribel Fernández, Prakash Panangaden:
The Ackermann Award 2024. 1:1-1:5 - Patricia Bouyer:
On the Probabilistic and Statistical Verification of Infinite Markov Chains (Invited Talk). 2:1-2:2 - Yannick Forster:
Synthetic Mathematics for the Mechanisation of Computability Theory and Logic (Invited Talk). 3:1-3:2 - Elaine Pimentel, Carlos Olarte, Timo Lang, Robert Freiman, Christian G. Fermüller:
Playing with Modalities (Invited Talk). 4:1-4:20 - Yde Venema:
Modal Automata: Analysing Modal Fixpoint Logics, One Step at a Time (Invited Talk). 5:1-5:5 - Benjamin Rossman:
Equi-Rank Homomorphism Preservation Theorem on Finite Structures. 6:1-6:17 - Ioannis Eleftheriadis:
Extension Preservation on Dense Graph Classes. 7:1-7:21 - Steffen van Bergerem, Martin Grohe, Nina Runde:
The Parameterized Complexity of Learning Monadic Second-Order Logic. 8:1-8:19 - Daumantas Kojelis:
On Homogeneous Models of Fluted Languages. 9:1-9:20 - Hadar Frenkel, Martin Zimmermann:
The Complexity of Second-Order HyperLTL. 10:1-10:23 - Thomas Colcombet, Alexander Rabinovich:
On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates. 11:1-11:26 - Simi Haber, Tal Hershko, Mostafa Mirabi, Saharon Shelah:
First-Order Logic with Equicardinality in Random Graphs. 12:1-12:17 - Moritz Lichter, Simon Raßmann, Pascal Schweitzer:
Computational Complexity of the Weisfeiler-Leman Dimension. 13:1-13:22 - Simon Raßmann, Georg Schindling, Pascal Schweitzer:
Finite Variable Counting Logics with Restricted Requantification. 14:1-14:23 - Steffen van Bergerem, Nicole Schweikardt:
On the VC Dimension of First-Order Logic with Counting and Weight Aggregation. 15:1-15:17 - Anuj Dawar, Bálint Molnár:
Undefinability of Approximation of 2-To-2 Games. 16:1-16:21 - Reijo Jaakkola, Antti Kuusisto, Miikka Vilander:
Description Complexity of Unary Structures in First-Order Logic with Links to Entropy. 17:1-17:20 - Andrew Scoones, Mahsa Shirmohammadi, James Worrell:
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates. 18:1-18:13 - Shaull Almagor, Michaël Cadilhac, Asaf Yeshurun:
Two-Way One-Counter Nets Revisited. 19:1-19:20 - Andrei Draghici, Radoslaw Piórkowski, Andrew Ryzhikov:
Boundedness of Cost Register Automata over the Integer Min-Plus Semiring. 20:1-20:23 - Rémi Morvan:
The Algebras for Automatic Relations. 21:1-21:21 - Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash:
On the Minimisation of Deterministic and History-Deterministic Generalised (Co)Büchi Automata. 22:1-22:18 - Aline Goeminne, Benjamin Monmege:
Permissive Equilibria in Multiplayer Reachability Games. 23:1-23:17 - Thibaut Antoine, David Baelde:
Propositional Logics of Overwhelming Truth. 24:1-24:19 - Konstantinos Papafilippou, David Fernández-Duque:
Exponential Lower Bounds on Definable Fixed Points. 25:1-25:19 - Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir:
The Complexity of Deciding Characteristic Formulae in Van Glabbeek's Branching-Time Spectrum. 26:1-26:18 - Thibaut Antoine, Robin Piedeleu, Alexandra Silva, Fabio Zanasi:
A Complete Diagrammatic Calculus for Automata Simulation. 27:1-27:22 - Filippo Bonchi, Elena Di Lavore, Anna Ricci:
Strong Induction Is an Up-To Technique. 28:1-28:21 - Samuel Humeau, Daniela Petrisan, Jurriaan Rot:
Correspondences Between Codensity and Coupling-Based Liftings, a Practical Approach. 29:1-29:18 - Corina Cîrstea, Lawrence S. Moss, Victoria Noquez, Todd Schmid, Alexandra Silva, Ana Sokolova:
A Complete Inference System for Probabilistic Infinite Trace Equivalence. 30:1-30:23 - Willem Heijltjes, Georgina Majury:
Simple Types for Probabilistic Termination. 31:1-31:21 - Victoria Vollmer, Danielle Marshall, Harley Eades III, Dominic Orchard:
A Mixed Linear and Graded Logic: Proofs, Terms, and Models. 32:1-32:21 - Jonas Forster, Lutz Schröder, Paul Wild, Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing:
Quantitative Graded Semantics and Spectra of Behavioural Metrics. 33:1-33:21 - Valentin Maestracci, Paolo Pistone:
The Lambda Calculus Is Quantifiable. 34:1-34:23 - Leandro Gomes, Patrick Baillot, Marco Gaboardi:
A Kleene Algebra with Tests for Union Bound Reasoning About Probabilistic Programs. 35:1-35:19 - Arthur Azevedo de Amorim, Cheng Zhang, Marco Gaboardi:
Kleene Algebra with Commutativity Conditions Is Undecidable. 36:1-36:25 - Yoshiki Nakamura:
Finite Relational Semantics for Language Kleene Algebra with Complement. 37:1-37:23 - Nicolas Heurtel:
A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors. 38:1-38:23 - Victoria Barrett, Alessio Guglielmi, Benjamin Ralph:
A Strictly Linear Subatomic Proof System. 39:1-39:22 - Dominik Kirst, Ian Shillito:
Completeness of First-Order Bi-Intuitionistic Logic. 40:1-40:19 - Tim S. Lyon, Ian Shillito, Alwen Tiu:
Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents. 41:1-41:23 - Tim S. Lyon:
Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations. 42:1-42:23 - Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco:
Linear Realisability over Nets: Multiplicatives. 43:1-43:21 - Pedro H. Azevedo de Amorim, Leon Witzman, Dexter Kozen:
Classical Linear Logic in Perfect Banach Lattices. 44:1-44:21 - Nima Rasekh, Niels van der Weide, Benedikt Ahrens, Paige Randall North:
Insights from Univalent Foundations: A Case Study Using Double Categories. 45:1-45:18 - Perry Hart, Kuen-Bang Hou (Favonia):
Coslice Colimits in Homotopy Type Theory. 46:1-46:20 - Claudia Faggian, Gaetan Lopez, Benoît Valiron:
A Rewriting Theory for Quantum λ-Calculus. 47:1-47:22 - Jonathan Barrett, Isaac Friend, Aleks Kissinger:
Quantum and Classical Markovian Graphical Causal Models and Their Identification. 48:1-48:23 - Marc de Visme, Renaud Vilmart:
Minimality in Finite-Dimensional ZW-Calculi. 49:1-49:22
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-31 23:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
