bibliographer

Nominal techniques as an Agda library Murdoch J. Gabbay Orestis Melkonian Sat 07 March 2026
Sensible Intersection Type Theories Mariangiola Dezani-Ciancaglini Besik Dundua Paola Giannini Furio Honsell Sat 07 March 2026
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes Florian Bruse Martin Lange Sun 01 February 2026
The Latent Space of Equational Theories Luis Berlioz Paul-André Melliès Sun 01 February 2026
How Expressive Are Graph Neural Networks in the Presence of Node Identifiers Arie Soeteman Michael Benedikt Martin Grohe Balder ten Cate Sun 01 February 2026
Polynomial-time Tractable Problems over the p-adic Numbers Arno Fehm Manuel Bodirsky Fri 25 April 2025
Complete First-Order Game Logic Noah Abou El Wafa André Platzer Fri 11 April 2025
Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof Manfred Borzechowski Malvin Gattinger Helle Hvid Hansen Revantha Ramanayake Valentina Trucco Dalmas Yde Venema Sat 05 April 2025
A formalization of Borel determinacy in Lean Sven Manthe Mon 10 March 2025
Logic.py: Bridging the Gap between LLMs and Constraint Solvers Pascal Kesseli Peter O'Hearn Ricardo Silveira Cabral Mon 03 March 2025
The equational theory of the Weihrauch lattice with (iterated) composition Cécilia Pradic Fri 31 January 2025
Multi-Structural Games and Beyond Marco Carmosino Ronald Fagin Neil Immerman Phokion Kolaitis Jonathan Lenchner Rik Sengupta Tue 10 December 2024
A LOCAL View of the Polynomial Hierarchy Fabian Reiter Sat 26 October 2024
mathbbN-polyregular functions arise from well-quasi-orderings Aliaume Lopez Fri 18 October 2024
Axiomatization of Compact Initial Value Problems: Open Properties André Platzer Long Qian Fri 18 October 2024
Certifying rings of integers in number fields Anne Baanen Alain Chavarri Villarello Sander R. Dahmen Sat 12 October 2024
A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL Richard Schmoetten Jacques D. Fleuriot Wed 31 July 2024
Validity of contextual formulas (extended version) Javier Esparza Rubén Rubio Mon 15 July 2024
Left-Linear Rewriting in Adhesive Categories Paolo Baldan Davide Castelnovo Andrea Corradini Fabio Gadducci Thu 11 July 2024
Lindenmayer graph languages, first-order theories and expanders Teodor Knapik Thu 30 May 2024
The Relational Machine Calculus Chris Barrett Daniel Castle Willem Heijltjes Wed 22 May 2024
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages Bharat Adsul Paul Gastin Shantanu Kulkarni Pascal Weil Wed 22 May 2024
Uniform Substitution for Differential Refinement Logic Enguerrand Prebet André Platzer Tue 30 April 2024
Existential Second-Order Logic Over Graphs: A Complete Complexity-Theoretic Classification Till Tantau Sun 21 April 2024
The General and Finite Satisfiability Problems for PCTL are Undecidable Miroslav Chodil Antonín Kučera Sat 20 April 2024
A Resolution-Based Interactive Proof System for UNSAT Philipp Czerner Javier Esparza Valentin Krasotin Thu 01 February 2024
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers C Aiswarya Soumodev Mal Prakash Saivasan Fri 19 January 2024
The Church Synthesis Problem with Parameters Alexander Rabinovich Sat 25 November 2023
On the Metric Temporal Logic for Continuous Stochastic Processes Mitsumasa Ikeda Yoriyuki Yamagata Takayuki Kihara Sat 25 November 2023
On Learning Polynomial Recursive Programs Alex Buna-Marginean Vincent Cheval Mahsa Shirmohammadi James Worrell Thu 26 October 2023
Dynamic Logics of Dynamical Systems André Platzer Fri 01 September 2023
Polynomial Identity Testing and the Ideal Proof System: PIT is in NP if and only if IPS can be p-simulated by a Cook-Reckhow proof system Joshua A. Grochow Tue 11 July 2023
Positive First-order Logic on Words and Graphs Denis Kuperberg Fri 26 May 2023
Fermat's Last Theorem for regular primes Alex J. Best Christopher Birkbeck Riccardo Brasca Eric Rodriguez Boidi Wed 24 May 2023
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity Clemens Grabmayer Fri 05 May 2023
Model-Checking Branching-Time Properties of Stateless Probabilistic Pushdown Systems and Related Expansion Tianrong Lin Thu 30 March 2023
Fixpoint operators for 2-categorical structures Zeinab Galal Fri 10 March 2023
On Presburger arithmetic extended with non-unary counting quantifiers Peter Habermehl Dietrich Kuske Fri 20 January 2023
Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions) Clemens Grabmayer Mon 03 October 2022
On Power Set Axiom Leonid A. Levin Fri 16 September 2022
Countdown mu-calculus Jędrzej Kołodziejski Bartek Klin Wed 03 August 2022
Natural Colors of Infinite Words Rudiger Ehlers Sven Schewe Tue 26 July 2022
Semantic Analysis of Normalisation by Evaluation for Typed Lambda Calculus Marcelo Fiore Thu 21 July 2022
On the Number of Quantifiers as a Complexity Measure Ronald Fagin Jonathan Lenchner Nikhil Vyas Ryan Williams Wed 13 July 2022
The Safe Lambda Calculus William Blum C. -H. Luke Ong Thu 31 March 2022
Logics Meet 2-Way 1-Clock Alternating Timed Automata Shankara Narayanan Krishna Khushraj Nanik Madnani Manuel Jr. Mazo Paritosh K. Pandya Wed 08 September 2021
A Survey of the Proof-Theoretic Foundations of Logic Programming Dale Miller Tue 07 September 2021
On sets of terms with a given intersection type Richard Statman Andrew Polonsky Wed 12 May 2021
Towards a more efficient approach for the satisfiability of two-variable logic Ting-Wei Lin Chia-Hsuan Lu Tony Tan Fri 30 April 2021
Scalar and Vectorial mu-calculus with Atoms Bartek Klin Mateusz Łełyk Wed 17 March 2021
Deductive Stability Proofs for Ordinary Differential Equations Yong Kiam Tan André Platzer Fri 30 October 2020
On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles Thomas Gogacz Víctor Gutiérrez-Basulto Yazmín Ibáñez-García Jean Christoph Jung Filip Murlak Sun 25 October 2020
The Complexity of the Homomorphism Problem for Boolean structures Libor Barto William DeMeo Antoine Mottet Thu 15 October 2020
Foundations Jeremy Avigad Tue 22 September 2020
Normalization by Evaluation for Call-by-Push-Value and Polarized Lambda-Calculus Andreas Abel Christian Sattler Mon 14 September 2020
Finite Model Reasoning in Expressive Fragments of First-Order Logic Lidia Tendera Tue 18 August 2020
Implicit automata in typed łambda-calculi II: streaming transducers vs categorical semantics Nguyên Thành Dũng Lê Camille Noûs Pierre Pradic Tue 04 August 2020
Logical Separability of Incomplete Data under Ontologies Jean Christoph Jung Carsten Lutz Hadrien Pulcini Frank Wolter Mon 06 July 2020
On the decidability and complexity of Metric Temporal Logic over finite words Joel Ouaknine James Worrell Mon 06 July 2020
The Extended Theory of Trees and Algebraic (Co)datatypes Fabian Zaiser C. -H. Luke Ong Tue 19 May 2020
Mathematical Logic in Computer Science Assaf Kfoury Sun 23 February 2020
Buchi automata recognizing sets of reals definable in first-order logic with addition and order Arthur Milchior Wed 12 February 2020
A proof of strong normalisation using domain theory Thierry Coquand Arnaud Spiwack Sat 08 February 2020
On the Parameterized Intractability of Monadic Second-Order Logic Stephan Kreutzer Thu 23 January 2020
Computer Science and Metaphysics: A Cross-Fertilization Daniel Kirchner Christoph Benzmuller Edward N. Zalta Fri 28 June 2019
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases Bernard Boigelot Julien Brusten Veronique Bruyere Fri 31 May 2019
The height of piecewise-testable languages and the complexity of the logic of subwords Prateek Karandikar Philippe Schnoebelen Wed 08 May 2019
Cubical Type Theory: a constructive interpretation of the univalence axiom Cyril Cohen Thierry Coquand Simon Huber Anders Mørtberg Mon 15 April 2019
Normalisation by Traversals C. -H. Luke Ong Fri 21 December 2018
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3 S. Kiefer I. Ponomarenko P. Schweitzer Thu 06 September 2018
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms L. Clemente S. Lasota Tue 01 May 2018

Library Size: 13G (71 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]