Skip to ContentSkip to Navigation
About us Practical matters How to find us D.R.S. (Revantha) Ramanayake, PhD

Research interests

  • Non-classical logics (substructural, modal, intermediate logics) and their applications in theoretical computer science
  • Using proof theory to investigate various aspects of logics, like decidability, complexity, interpolation
  • Structural proof theory: relative expressivity of proof formalisms
  • Development of interactive/automated verification of structural proof theory using proof assistants
  • Formal logics for the provability predicate of arithmetic (provability logics)


Bounded-analytic sequent calculi and embeddings for hypersequent logics

Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics

Display to Labeled Proofs and Back Again for Tense Logics

Extended Kripke lemma and decidability for hypersequent substructural logics

Bounded Sequent Calculi for Non-classical Logics via Hypersequents

Sequentialising Nested Systems

From Display to Labelled Proofs for Tense Logics

Inducing syntactic cut-elimination for indexed nested sequents

Bunched Hypersequent Calculi for Distributive Substructural Logics

Read more