Revantha Ramanayake

Orcid: 0000-0002-7940-9065

Affiliations:
  • University of Groningen, The Netherlands
  • TU Wien, Vienna, Autria
  • The Australian National University, Canberra, Australia


According to our database1, Revantha Ramanayake authored at least 27 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Deducibility in the Full Lambek Calculus with Weakening Is HAck-Complete.
Proceedings of the Advances in Modal Logic, AiML 2024, Prague, Czech Republic, 2024

2023
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations.
CoRR, 2023

Cut-Restriction: From Cuts to Analytic Cuts.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Analytic Proof Theory for Åqvist's System F.
Proceedings of the Deontic Logic and Normative Systems - 16th International Conference, 2023

2022
A theory of cut-restriction: first steps.
CoRR, 2022

2021
Display to Labeled Proofs and Back Again for Tense Logics.
ACM Trans. Comput. Log., 2021

Bounded-analytic Sequent Calculi and Embeddings for Hypersequent Logics.
J. Symb. Log., 2021

Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
Extended Kripke lemma and decidability for hypersequent substructural logics.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Display to Labelled Proofs and Back Again for Tense Logics.
CoRR, 2019

Sequentialising Nested Systems.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

Bounded Sequent Calculi for Non-classical Logics via Hypersequents.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

2018
Substructural logics: <i>semantics, proof theory, and applications.</i> report on the second SYSMICS workshop.
ACM SIGLOG News, 2018

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

From Display to Labelled Proofs for Tense Logics.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017
Bunched Hypersequent Calculi for Distributive Substructural Logics.
Proceedings of the LPAR-21, 2017

2016
Power and Limits of Structural Display Rules.
ACM Trans. Comput. Log., 2016

Non-commutative classical arithmetical sequent calculi are intuitionistic.
Log. J. IGPL, 2016

A purely syntactic proof of decidability for BI.
CoRR, 2016

From Axioms to Proof Rules, then add Quantifiers.
Proceedings of the 2nd International Workshop Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2016) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2016)., 2016

2015
Embedding the hypersequent calculus in the display calculus.
J. Log. Comput., 2015

2014
Cut-elimination for Weak Grzegorczyk Logic Go.
Stud Logica, 2014

Hypersequent and Display Calculi - a Unified Perspective.
Stud Logica, 2014

2013
Structural Extensions of Display Calculi: A General Recipe.
Proceedings of the Logic, Language, Information, and Computation, 2013

2012
Valentini's Cut-Elimination for Provability Logic resolved.
Rev. Symb. Log., 2012

Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents.
Proceedings of the Advances in Modal Logic 9, 2012


  Loading...