From syntactic proofs to combinatorial proofs, International Joint Conference on Automated Reasoning, pp.481-497, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01942275
On combinatorial proofs for logics of relevance and entailment, International Workshop on Logic, Language, Information, and Computation, pp.1-16, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02390426
The method of hypersequents in the proof theory of propositional nonclassical logics, Logic: from foundations to applications, European Logic Colloquium, pp.1-32, 1994. ,
Towards a combinatorial proof theory, Tableaux 2019, 2019. ,
Deep sequent systems for modal logic, Archive for Mathematical Logic, vol.48, issue.6, pp.551-577, 2009. ,
A local system for classical logic, LPAR 2001. LNAI, vol.2250, pp.347-361, 2001. ,
Focused and synthetic nested sequents, FoSSaCS'16, pp.390-407, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01417618
Modular Focused Proof Systems for Intuitionistic Modal Logics, 18. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol.52, pp.1-16, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01417603
The relative efficiency of propositional proof systems, J. of Symb. Logic, vol.44, issue.1, pp.36-50, 1979. ,
On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics, Logical Methods in Computer Science, vol.7, issue.2, 2011. ,
Labelled tree sequents, tree hypersequents and nested (deep) sequents. Advances in modal logic 9, pp.279-299, 2012. ,
A system of interaction and structure, ACM Transactions on Computational Logic, vol.8, issue.1, pp.1-64, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00441254
Non-commutativity and MELL in the calculus of structures, CSL 2001, vol.2142, pp.54-68, 2001. ,
Purity through unravelling. Structures and Deduction pp, pp.126-143, 2005. ,
Proofs Without Syntax, Annals of Math, vol.164, issue.3, pp.1065-1076, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-02386878
Towards Hilbert's 24 th problem: Combinatorial proof invariants: (preliminary version), Electr. Notes Theor. Comput. Sci, vol.165, pp.37-63, 2006. ,
First-order proofs without syntax, 2019. ,
Hypersequent rules with restricted contexts for propositional modal logics, Theoretical Computer Science, vol.656, pp.76-105, 2016. ,
Modularisation of sequent calculi for normal and nonnormal modalities, ACM Transactions on Computational Logic (TOCL), vol.20, issue.2, p.7, 2019. ,
Label-free Modular Systems for Classical and Intuitionistic Modal Logics, Advances in Modal Logic, vol.10, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01092148
Computationally tractable classes of ordered sets, pp.105-194, 1989. ,
Proof analysis in modal logic, Journal of Philosophical Logic, vol.34, issue.5-6, p.507, 2005. ,
Pomset logic: a non-commutative extension of classical linear logic, TLCA 1997, pp.300-318, 1997. ,
Handsome proof-nets: perfect matchings and cographs, Theor. Comput. Sci, vol.294, issue.3, pp.473-488, 2003. ,
The proof theory and semantics of intuitionistic modal logic, 1994. ,
A systematic proof theory for several modal logics. Advances in modal logic, vol.5, pp.309-333, 2004. ,
A characterization of medial as rewriting rule, RTA'07, vol.4533, pp.344-358, 2007. ,
Cut elimination in nested sequents for intuitionistic modal logics, FoSSaCS'13, vol.7794, pp.209-224, 2013. ,
Combinatorial flows and their normalisation, FSCD'17. LIPIcs, vol.84, pp.1-31, 2017. ,
The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem, Philosophical Transactions of the Royal Society A, vol.377, p.20180038, 2019. ,
Hilbert's twenty-fourth problem, American Math. Monthly, vol.110, pp.1-24, 2003. ,
Sequent calculi for normal modal propositional logics, Journal of Logic and Computation, vol.4, issue.2, pp.125-142, 1994. ,
Sequent systems for modal logics, Handbook of philosophical logic, pp.61-145, 2002. ,