- Pablo Barenbaum, Teodoro Freund:
Proofs and Refutations for Intuitionistic and Second-Order Logic. CSL 2023: 9:1-9:18 - Chris Barrett
, Willem Heijltjes, Guy McCusker:
The Functional Machine Calculus II: Semantics. CSL 2023: 10:1-10:18 - Nikolay Bazhenov, Dariusz Kalocinski:
Degree Spectra, and Relative Acceptability of Notations. CSL 2023: 11:1-11:20 - Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing:
Hennessy-Milner Theorems via Galois Connections. CSL 2023: 12:1-12:18 - Kostia Chardonnet, Alexis Saurin, Benoît Valiron:
A Curry-Howard Correspondence for Linear, Reversible Computation. CSL 2023: 13:1-13:18 - Corina Cîrstea, Clemens Kupke:
Measure-Theoretic Semantics for Quantitative Parity Automata. CSL 2023: 14:1-14:20 - Gianluca Curzi, Anupam Das:
Non-Uniform Complexity via Non-Wellfounded Proofs. CSL 2023: 16:1-16:18 - Claudia Faggian:
Asymptotic Rewriting (Invited Talk). CSL 2023: 1:1-1:2 - Thiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal:
Translating Proofs from an Impredicative Type System to a Predicative One. CSL 2023: 19:1-19:19 - Dana Fisman, Joshua Grogin, Gera Weiss:
A Normalized Edit Distance on Infinite Words. CSL 2023: 20:1-20:20 - Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. CSL 2023: 22:1-22:20 - Nina Gierasimczuk:
Inductive Inference and Epistemic Modal Logic (Invited Talk). CSL 2023: 2:1-2:16 - Julien Grange:
Order-Invariance in the Two-Variable Fragment of First-Order Logic. CSL 2023: 23:1-23:19 - Emile Hazard, Denis Kuperberg:
Explorable Automata. CSL 2023: 24:1-24:18 - Lauri Hella:
The Expressive Power of CSP-Quantifiers. CSL 2023: 25:1-25:19 - Reijo Jaakkola:
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. CSL 2023: 26:1-26:18 - Reijo Jaakkola, Antti Kuusisto:
Complexity Classifications via Algebraic Logic. CSL 2023: 27:1-27:18 - Dominik Kirst, Benjamin Peters:
Gödel's Theorem Without Tears - Essential Incompleteness in Synthetic Computability. CSL 2023: 30:1-30:18 - Cédric de Lacroix, Luigi Santocanale:
Frobenius Structures in Star-Autonomous Categories. CSL 2023: 18:1-18:20 - Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen:
Open Higher-Order Logic. CSL 2023: 17:1-17:17 - Benedikt Pago:
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CSL 2023: 31:1-31:19 - Ian Pratt-Hartmann, Lidia Tendera:
Adding Transitivity and Counting to the Fluted Fragment. CSL 2023: 32:1-32:22 - Davide Sangiorgi:
Enhanced Induction in Behavioural Relations (Invited Talk). CSL 2023: 4:1-4:6 - Konrad Staniszewski:
Parity Games of Bounded Tree-Depth. CSL 2023: 33:1-33:20 - Hiromi Tanaka:
Tower-Complete Problems in Contraction-Free Substructural Logics. CSL 2023: 34:1-34:19 - Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Regular Languages: Big Changes, Small Work. CSL 2023: 35:1-35:19 - Renaud Vilmart:
Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. CSL 2023: 36:1-36:17 - Thorsten Wißmann:
Supported Sets - A New Foundation for Nominal Sets and Automata. CSL 2023: 38:1-38:19 - Front Matter, Table of Contents, Preface, Conference Organization. CSL 2023: 0:1-0:18
- Bartek Klin, Elaine Pimentel:
31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland. LIPIcs 252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-264-8 [contents]
