Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents. - Rajeev Goré; Revantha Ramanayake (Advances in Modal Logic, 2012)

Valentini's Cut-Elimination for Provability Logic resolved. - Rajeev Goré; Revantha Ramanayake (Rev. Symb. Log., 2012)

Structural Extensions of Display Calculi: A General Recipe. - Agata Ciabattoni; Revantha Ramanayake (WoLLIC, 2013)

Hypersequent and Display Calculi - a Unified Perspective. - Agata Ciabattoni; Revantha Ramanayake; Heinrich Wansing (Stud Logica, 2014)

Cut-elimination for Weak Grzegorczyk Logic Go. - Rajeev Goré; Revantha Ramanayake (Stud Logica, 2014)

Embedding the hypersequent calculus in the display calculus. - Revantha Ramanayake (J. Log. Comput., 2015)

From Axioms to Proof Rules, then add Quantifiers. - Revantha Ramanayake (ARQNL@IJCAR, 2016)

A purely syntactic proof of decidability for BI. - Revantha Ramanayake (CoRR, 2016)

Non-commutative classical arithmetical sequent calculi are intuitionistic. - Revantha Ramanayake (Log. J. IGPL, 2016)

Power and Limits of Structural Display Rules. - Agata Ciabattoni; Revantha Ramanayake (ACM Trans. Comput. Log., 2016)

Bunched Hypersequent Calculi for Distributive Substructural Logics. - Agata Ciabattoni; Revantha Ramanayake (LPAR, 2017)

From Display to Labelled Proofs for Tense Logics. - Agata Ciabattoni; Tim S. Lyon; Revantha Ramanayake (LFCS, 2018)

Inducing syntactic cut-elimination for indexed nested sequents. - Revantha Ramanayake (Log. Methods Comput. Sci., 2018)

Substructural logics: semantics, proof theory, and applications. report on the second SYSMICS workshop. - Agata Ciabattoni; Francesco A. Genco; Revantha Ramanayake (ACM SIGLOG News, 2018)

Bounded Sequent Calculi for Non-classical Logics via Hypersequents. - Agata Ciabattoni; Timo Lang; Revantha Ramanayake (TABLEAUX, 2019)

Sequentialising Nested Systems. - Elaine Pimentel; Revantha Ramanayake; Björn Lellmann (TABLEAUX, 2019)

Display to Labelled Proofs and Back Again for Tense Logics. - Agata Ciabattoni; Tim S. Lyon; Revantha Ramanayake; Alwen Tiu (CoRR, 2019)

Extended Kripke lemma and decidability for hypersequent substructural logics. - Revantha Ramanayake (LICS, 2020)

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. - A. R. Balasubramanian; Timo Lang; Revantha Ramanayake (LICS, 2021)

Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq. - Rajeev Goré; Revantha Ramanayake; Ian Shillito (TABLEAUX, 2021)

Bounded-analytic Sequent Calculi and Embeddings for Hypersequent Logics. - Agata Ciabattoni; Timo Lang; Revantha Ramanayake (J. Symb. Log., 2021)

Display to Labeled Proofs and Back Again for Tense Logics. - Agata Ciabattoni; Tim S. Lyon; Revantha Ramanayake; Alwen Tiu (ACM Trans. Comput. Log., 2021)

A theory of cut-restriction: first steps. - Agata Ciabattoni; Timo Lang; Revantha Ramanayake (CoRR, 2022)

Analytic Proof Theory for Åqvist's System F. - Agata Ciabattoni; Nicola Olivetti; Xavier Parent 001; Revantha Ramanayake; Dmitry Rozplokhas (DEON, 2023)

Cut-Restriction: From Cuts to Analytic Cuts. - Agata Ciabattoni; Timo Lang; Revantha Ramanayake (LICS, 2023)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations. - Tim S. Lyon; Agata Ciabattoni; Didier Galmiche; Marianna Girlando; Dominique Larchey-Wendling; Daniel Méry; Nicola Olivetti; Revantha Ramanayake (CoRR, 2023)

Deducibility in the Full Lambek Calculus with Weakening Is HAck-Complete. - Vitor Greati; Revantha Ramanayake (AiML, 2024)

Implementing Intermediate Logics. - Bastiaan Haaksema; Jens Otten; Revantha Ramanayake (ARQNL@IJCAR, 2024)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof. - Manfred Borzechowski; Malvin Gattinger; Helle Hvid Hansen; Revantha Ramanayake; Valentina Trucco Dalmas; Yde Venema (CoRR, 2025)

Complexities of Well-Quasi-Ordered Substructural Logics. - Nikolaos Galatos; Vitor Greati; Revantha Ramanayake; Gavin St. John (CoRR, 2025)