Logic beyond formulas: A proof system on graphs M Acclavio, R Horne, L Straßburger Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 18 | 2020 |
From syntactic proofs to combinatorial proofs M Acclavio, L Straßburger Automated Reasoning: 9th International Joint Conference, IJCAR 2018, Held as …, 2018 | 17 | 2018 |
Generalized connectives for multiplicative linear logic M Acclavio, R Maieli CSL 2020-28th EACSL annual conference on Computer Science Logic 152, 6: 1-6: 15, 2020 | 16 | 2020 |
A graphical proof theory of logical time M Acclavio, R Horne, S Mauw, L Straßburger FSCD 2022-7th International Conference on Formal Structures for Computation …, 2022 | 12 | 2022 |
Game semantics for constructive modal logic M Acclavio, D Catta, L Straßburger International Conference on Automated Reasoning with Analytic Tableaux and …, 2021 | 11 | 2021 |
On combinatorial proofs for modal logic M Acclavio, L Straßburger International Conference on Automated Reasoning with Analytic Tableaux and …, 2019 | 11 | 2019 |
On combinatorial proofs for logics of relevance and entailment M Acclavio, L Straßburger Logic, Language, Information, and Computation: 26th International Workshop …, 2019 | 11 | 2019 |
An analytic propositional proof system on graphs M Acclavio, R Horne, L Straßburger Logical Methods in Computer Science 18, 2022 | 9 | 2022 |
Proof diagrams for multiplicative linear logic: Syntax and semantics M Acclavio Journal of Automated Reasoning 63 (4), 911-939, 2019 | 7 | 2019 |
Combinatorial proofs for constructive modal logic M Acclavio, L Straßburger AiML 2022-Advances in Modal Logic, 2022 | 5 | 2022 |
Infinitary cut-elimination via finite approximations M Acclavio, G Curzi, G Guerrieri arXiv preprint arXiv:2308.07789, 2023 | 4 | 2023 |
Towards a denotational semantics for proofs in constructive modal logic M Acclavio, D Catta, L Straßburger arXiv preprint arXiv:2104.09115, 2021 | 4 | 2021 |
A complete proof of coherence for symmetric monoidal categories using rewriting M Acclavio | 4 | 2016 |
Exponentially handsome proof nets and their normalization M Acclavio arXiv preprint arXiv:2112.14962, 2021 | 3 | 2021 |
String diagram rewriting: applications in category and proof theory M Acclavio Aix-Marseille, 2016 | 3 | 2016 |
A deep inference system for differential linear logic M Acclavio, G Guerrieri arXiv preprint arXiv:2112.14963, 2021 | 2 | 2021 |
A Constructive Proof of Coherence for Symmetric Monoidal Categories Using Rewriting M Acclavio arXiv preprint arXiv:1606.01722, 2016 | 2 | 2016 |
Lorenzen-Style Strategies as Proof-Search Strategies M Acclavio, D Catta European Conference on Multi-Agent Systems, 150-166, 2023 | 1 | 2023 |
Proof diagrams for multiplicative linear logic M Acclavio arXiv preprint arXiv:1606.09016, 2016 | 1 | 2016 |
Non-uniform polynomial time via non-wellfounded parsimonious proofs M Acclavio, G Curzi, G Guerrieri Unpublished. URL: http://gianlucacurzi. com/Non-uniform-polynomial-time-via …, 0 | 1 | |