Abstract is missing.
- Open Higher-Order LogicUgo Dal Lago, Francesco Gavazzo, Alexis Ghyselen. [doi]
- Enhanced Induction in Behavioural Relations (Invited Talk)Davide Sangiorgi. [doi]
- Explorable AutomataEmile Hazard, Denis Kuperberg. [doi]
- A Lattice-Theoretical View of Strategy IterationPaolo Baldan, Richard Eggert, Barbara König 0001, Tommaso Padoan. [doi]
- Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial CalculusBenedikt Pago. [doi]
- Complexity Classifications via Algebraic LogicReijo Jaakkola, Antti Kuusisto. [doi]
- Functorial String Diagrams for Reverse-Mode Automatic DifferentiationMario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Degree Spectra, and Relative Acceptability of NotationsNikolay Bazhenov, Dariusz Kalocinski. [doi]
- String Diagrams for Non-Strict Monoidal CategoriesPaul W. Wilson 0002, Dan R. Ghica, Fabio Zanasi. [doi]
- Proofs and Refutations for Intuitionistic and Second-Order LogicPablo Barenbaum, Teodoro Freund. [doi]
- Gödel's Theorem Without Tears - Essential Incompleteness in Synthetic ComputabilityDominik Kirst, Benjamin Peters. [doi]
- Tower-Complete Problems in Contraction-Free Substructural LogicsHiromi Tanaka. [doi]
- Inductive Inference and Epistemic Modal Logic (Invited Talk)Nina Gierasimczuk. [doi]
- Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum ComputationRenaud Vilmart. [doi]
- Translating Proofs from an Impredicative Type System to a Predicative OneThiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal. [doi]
- Asymptotic Rewriting (Invited Talk)Claudia Faggian. [doi]
- Counting and MatchingBart Jacobs 0001, Dario Stein. [doi]
- Dynamic Complexity of Regular Languages: Big Changes, Small WorkFelix Tschirbs, Nils Vortmeier, Thomas Zeume. [doi]
- The Functional Machine Calculus II: SemanticsChris Barrett, Willem Heijltjes, Guy McCusker. [doi]
- Frobenius Structures in Star-Autonomous CategoriesCédric de Lacroix, Luigi Santocanale. [doi]
- Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-One and Truth-Table Reducibility in CoqYannick Forster 0002, Felix Jahn. [doi]
- Adding Transitivity and Counting to the Fluted FragmentIan Pratt-Hartmann, Lidia Tendera. [doi]
- Supported Sets - A New Foundation for Nominal Sets and AutomataThorsten Wißmann. [doi]
- A Positive Perspective on Term Representation (Invited Talk)Dale Miller 0001, Jui-Hsuan Wu. [doi]
- A Cyclic Proof System for Full Computation Tree LogicBahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata. [doi]
- A Normalized Edit Distance on Infinite WordsDana Fisman, Joshua Grogin, Gera Weiss. [doi]
- Measure-Theoretic Semantics for Quantitative Parity AutomataCorina Cîrstea, Clemens Kupke. [doi]
- Quantitative Hennessy-Milner Theorems via Notions of DensityJonas Forster, Sergey Goncharov 0001, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild. [doi]
- Parity Games of Bounded Tree-DepthKonrad Staniszewski. [doi]
- Evaluation Trade-Offs for Acyclic Conjunctive QueriesAhmet Kara 0002, Milos Nikolic 0001, Dan Olteanu, Haozhe Zhang. [doi]
- A Curry-Howard Correspondence for Linear, Reversible ComputationKostia Chardonnet, Alexis Saurin, Benoît Valiron. [doi]
- Complexity of Polyadic Boolean Modal Logics: Model Checking and SatisfiabilityReijo Jaakkola. [doi]
- Reductions in Higher-Order Rewriting and Their EquivalencePablo Barenbaum, Eduardo Bonelli. [doi]
- Realizing Continuity Using Stateful ComputationsLiron Cohen 0001, Vincent Rahli. [doi]
- Non-Uniform Complexity via Non-Wellfounded ProofsGianluca Curzi, Anupam Das 0002. [doi]
- The Expressive Power of CSP-QuantifiersLauri Hella. [doi]
- Hennessy-Milner Theorems via Galois ConnectionsHarsh Beohar, Sebastian Gurke, Barbara König 0001, Karla Messing. [doi]
- Order-Invariance in the Two-Variable Fragment of First-Order LogicJulien Grange. [doi]