LIPIcs, Volume 252, CSL 2023

• Bartek Klin and Elaine Pimentel LIPIcs, Volume 252, CSL 2023, Complete Volume 10.4230/LIPIcs.CSL.2023
• Bartek Klin and Elaine Pimentel Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CSL.2023.0
• Claudia Faggian Asymptotic Rewriting (Invited Talk) 10.4230/LIPIcs.CSL.2023.1
• Nina Gierasimczuk Inductive Inference and Epistemic Modal Logic (Invited Talk) 10.4230/LIPIcs.CSL.2023.2
• Dale Miller and Jui-Hsuan Wu A Positive Perspective on Term Representation (Invited Talk) 10.4230/LIPIcs.CSL.2023.3
• Davide Sangiorgi Enhanced Induction in Behavioural Relations (Invited Talk) 10.4230/LIPIcs.CSL.2023.4
• Bahareh Afshari, Graham E. Leigh, and Guillermo Menéndez Turata A Cyclic Proof System for Full Computation Tree Logic 10.4230/LIPIcs.CSL.2023.5
• Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi Functorial String Diagrams for Reverse-Mode Automatic Differentiation 10.4230/LIPIcs.CSL.2023.6
• Paolo Baldan, Richard Eggert, Barbara König, and Tommaso Padoan A Lattice-Theoretical View of Strategy Iteration 10.4230/LIPIcs.CSL.2023.7
• Pablo Barenbaum and Eduardo Bonelli Reductions in Higher-Order Rewriting and Their Equivalence 10.4230/LIPIcs.CSL.2023.8
• Pablo Barenbaum and Teodoro Freund Proofs and Refutations for Intuitionistic and Second-Order Logic 10.4230/LIPIcs.CSL.2023.9
• Chris Barrett, Willem Heijltjes, and Guy McCusker The Functional Machine Calculus II: Semantics 10.4230/LIPIcs.CSL.2023.10
• Nikolay Bazhenov and Dariusz Kalociński Degree Spectra, and Relative Acceptability of Notations 10.4230/LIPIcs.CSL.2023.11
• Harsh Beohar, Sebastian Gurke, Barbara König, and Karla Messing Hennessy-Milner Theorems via Galois Connections 10.4230/LIPIcs.CSL.2023.12
• Kostia Chardonnet, Alexis Saurin, and Benoît Valiron A Curry-Howard Correspondence for Linear, Reversible Computation 10.4230/LIPIcs.CSL.2023.13
• Corina Cîrstea and Clemens Kupke Measure-Theoretic Semantics for Quantitative Parity Automata 10.4230/LIPIcs.CSL.2023.14
• Liron Cohen and Vincent Rahli Realizing Continuity Using Stateful Computations 10.4230/LIPIcs.CSL.2023.15
• Gianluca Curzi and Anupam Das Non-Uniform Complexity via Non-Wellfounded Proofs 10.4230/LIPIcs.CSL.2023.16
• Ugo Dal Lago, Francesco Gavazzo, and Alexis Ghyselen Open Higher-Order Logic 10.4230/LIPIcs.CSL.2023.17
• Cédric de Lacroix and Luigi Santocanale Frobenius Structures in Star-Autonomous Categories 10.4230/LIPIcs.CSL.2023.18
• Thiago Felicissimo, Frédéric Blanqui, and Ashish Kumar Barnawal Translating Proofs from an Impredicative Type System to a Predicative One 10.4230/LIPIcs.CSL.2023.19
• Dana Fisman, Joshua Grogin, and Gera Weiss A Normalized Edit Distance on Infinite Words 10.4230/LIPIcs.CSL.2023.20
• Yannick Forster and Felix Jahn Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in Coq 10.4230/LIPIcs.CSL.2023.21
• Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, and Paul Wild Quantitative Hennessy-Milner Theorems via Notions of Density 10.4230/LIPIcs.CSL.2023.22
• Julien Grange Order-Invariance in the Two-Variable Fragment of First-Order Logic 10.4230/LIPIcs.CSL.2023.23
• Emile Hazard and Denis Kuperberg Explorable Automata 10.4230/LIPIcs.CSL.2023.24
• Lauri Hella The Expressive Power of CSP-Quantifiers 10.4230/LIPIcs.CSL.2023.25
• Reijo Jaakkola Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability 10.4230/LIPIcs.CSL.2023.26
• Reijo Jaakkola and Antti Kuusisto Complexity Classifications via Algebraic Logic 10.4230/LIPIcs.CSL.2023.27
• Bart Jacobs and Dario Stein Counting and Matching 10.4230/LIPIcs.CSL.2023.28
• Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang Evaluation Trade-Offs for Acyclic Conjunctive Queries 10.4230/LIPIcs.CSL.2023.29
• Dominik Kirst and Benjamin Peters Gödel’s Theorem Without Tears - Essential Incompleteness in Synthetic Computability 10.4230/LIPIcs.CSL.2023.30
• Benedikt Pago Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus 10.4230/LIPIcs.CSL.2023.31
• Ian Pratt-Hartmann and Lidia Tendera Adding Transitivity and Counting to the Fluted Fragment 10.4230/LIPIcs.CSL.2023.32
• Konrad Staniszewski Parity Games of Bounded Tree-Depth 10.4230/LIPIcs.CSL.2023.33
• Hiromi Tanaka Tower-Complete Problems in Contraction-Free Substructural Logics 10.4230/LIPIcs.CSL.2023.34
• Felix Tschirbs, Nils Vortmeier, and Thomas Zeume Dynamic Complexity of Regular Languages: Big Changes, Small Work 10.4230/LIPIcs.CSL.2023.35
• Renaud Vilmart Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation 10.4230/LIPIcs.CSL.2023.36
• Paul Wilson, Dan Ghica, and Fabio Zanasi String Diagrams for Non-Strict Monoidal Categories 10.4230/LIPIcs.CSL.2023.37
• Thorsten Wißmann Supported Sets - A New Foundation for Nominal Sets and Automata 10.4230/LIPIcs.CSL.2023.38