Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st CSL 2023: Warsaw, Poland
- 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 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Claudia Faggian:
Asymptotic Rewriting (Invited Talk). 1:1-1:2 - Nina Gierasimczuk:
Inductive Inference and Epistemic Modal Logic (Invited Talk). 2:1-2:16 - Dale Miller, Jui-Hsuan Wu:
A Positive Perspective on Term Representation (Invited Talk). 3:1-3:21 - Davide Sangiorgi:
Enhanced Induction in Behavioural Relations (Invited Talk). 4:1-4:6 - Bahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata:
A Cyclic Proof System for Full Computation Tree Logic. 5:1-5:19 - Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Functorial String Diagrams for Reverse-Mode Automatic Differentiation. 6:1-6:20 - Paolo Baldan, Richard Eggert, Barbara König, Tommaso Padoan:
A Lattice-Theoretical View of Strategy Iteration. 7:1-7:19 - Pablo Barenbaum, Eduardo Bonelli:
Reductions in Higher-Order Rewriting and Their Equivalence. 8:1-8:18 - Pablo Barenbaum, Teodoro Freund:
Proofs and Refutations for Intuitionistic and Second-Order Logic. 9:1-9:18 - Chris Barrett, Willem Heijltjes, Guy McCusker:
The Functional Machine Calculus II: Semantics. 10:1-10:18 - Nikolay Bazhenov, Dariusz Kalocinski:
Degree Spectra, and Relative Acceptability of Notations. 11:1-11:20 - Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing:
Hennessy-Milner Theorems via Galois Connections. 12:1-12:18 - Kostia Chardonnet, Alexis Saurin, Benoît Valiron:
A Curry-Howard Correspondence for Linear, Reversible Computation. 13:1-13:18 - Corina Cîrstea, Clemens Kupke:
Measure-Theoretic Semantics for Quantitative Parity Automata. 14:1-14:20 - Liron Cohen, Vincent Rahli:
Realizing Continuity Using Stateful Computations. 15:1-15:18 - Gianluca Curzi, Anupam Das:
Non-Uniform Complexity via Non-Wellfounded Proofs. 16:1-16:18 - Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen:
Open Higher-Order Logic. 17:1-17:17 - Cédric de Lacroix, Luigi Santocanale:
Frobenius Structures in Star-Autonomous Categories. 18:1-18:20 - Thiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal:
Translating Proofs from an Impredicative Type System to a Predicative One. 19:1-19:19 - Dana Fisman, Joshua Grogin, Gera Weiss:
A Normalized Edit Distance on Infinite Words. 20:1-20:20 - Yannick Forster, Felix Jahn:
Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-One and Truth-Table Reducibility in Coq. 21:1-21:21 - Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Quantitative Hennessy-Milner Theorems via Notions of Density. 22:1-22:20 - Julien Grange:
Order-Invariance in the Two-Variable Fragment of First-Order Logic. 23:1-23:19 - Emile Hazard, Denis Kuperberg:
Explorable Automata. 24:1-24:18 - Lauri Hella:
The Expressive Power of CSP-Quantifiers. 25:1-25:19 - Reijo Jaakkola:
Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability. 26:1-26:18 - Reijo Jaakkola, Antti Kuusisto:
Complexity Classifications via Algebraic Logic. 27:1-27:18 - Bart Jacobs, Dario Stein:
Counting and Matching. 28:1-28:15 - Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Evaluation Trade-Offs for Acyclic Conjunctive Queries. 29:1-29:20 - Dominik Kirst, Benjamin Peters:
Gödel's Theorem Without Tears - Essential Incompleteness in Synthetic Computability. 30:1-30:18 - Benedikt Pago:
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. 31:1-31:19 - Ian Pratt-Hartmann, Lidia Tendera:
Adding Transitivity and Counting to the Fluted Fragment. 32:1-32:22 - Konrad Staniszewski:
Parity Games of Bounded Tree-Depth. 33:1-33:20 - Hiromi Tanaka:
Tower-Complete Problems in Contraction-Free Substructural Logics. 34:1-34:19 - Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Regular Languages: Big Changes, Small Work. 35:1-35:19 - Renaud Vilmart:
Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation. 36:1-36:17 - Paul W. Wilson, Dan R. Ghica, Fabio Zanasi:
String Diagrams for Non-Strict Monoidal Categories. 37:1-37:19 - Thorsten Wißmann:
Supported Sets - A New Foundation for Nominal Sets and Automata. 38:1-38:19
a service of 
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 2024-06-21 22:52 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:
