default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRevantha Ramanayake
Person information
- affiliation: University of Groningen, The Netherlands
- affiliation: TU Wien, Vienna, Autria
- affiliation: The Australian National University, Canberra, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Vitor Greati, Revantha Ramanayake:
Deducibility in the Full Lambek Calculus with Weakening Is HAck-Complete. AiML 2024: 401-422- [i8]Vitor Greati, Revantha Ramanayake:
Deducibility in the full Lambek calculus with weakening is HAck-complete. CoRR abs/2406.15626 (2024) - 2023
- [c14]Agata Ciabattoni, Nicola Olivetti, Xavier Parent, Revantha Ramanayake, Dmitry Rozplokhas:
Analytic Proof Theory for Åqvist's System F. DEON 2023: 79-98 - [c13]Agata Ciabattoni
, Timo Lang, Revantha Ramanayake:
Cut-Restriction: From Cuts to Analytic Cuts. LICS 2023: 1-13 - [e1]Revantha Ramanayake, Josef Urban:
Automated Reasoning with Analytic Tableaux and Related Methods - 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18-21, 2023, Proceedings. Lecture Notes in Computer Science 14278, Springer 2023, ISBN 978-3-031-43512-6 [contents] - [i7]Agata Ciabattoni, Timo Lang, Revantha Ramanayake:
Cut-restriction: from cuts to analytic cuts. CoRR abs/2304.13657 (2023) - [i6]Tim S. Lyon, Agata Ciabattoni, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry, Nicola Olivetti, Revantha Ramanayake:
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations. CoRR abs/2312.03426 (2023) - 2022
- [i5]Agata Ciabattoni, Timo Lang, Revantha Ramanayake:
A theory of cut-restriction: first steps. CoRR abs/2203.01600 (2022) - 2021
- [j10]Agata Ciabattoni, Timo Lang, Revantha Ramanayake:
Bounded-analytic Sequent Calculi and Embeddings for Hypersequent Logics. J. Symb. Log. 86(2): 635-668 (2021) - [j9]Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake, Alwen Tiu:
Display to Labeled Proofs and Back Again for Tense Logics. ACM Trans. Comput. Log. 22(3): 20:1-20:31 (2021) - [c12]A. R. Balasubramanian, Timo Lang, Revantha Ramanayake:
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. LICS 2021: 1-13 - [c11]Rajeev Goré, Revantha Ramanayake, Ian Shillito:
Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq. TABLEAUX 2021: 299-313 - [i4]A. R. Balasubramanian, Timo Lang, Revantha Ramanayake:
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. CoRR abs/2104.09716 (2021) - 2020
- [c10]Revantha Ramanayake:
Extended Kripke lemma and decidability for hypersequent substructural logics. LICS 2020: 795-806
2010 – 2019
- 2019
- [c9]Agata Ciabattoni, Timo Lang, Revantha Ramanayake:
Bounded Sequent Calculi for Non-classical Logics via Hypersequents. TABLEAUX 2019: 94-110 - [c8]Elaine Pimentel, Revantha Ramanayake, Björn Lellmann:
Sequentialising Nested Systems. TABLEAUX 2019: 147-165 - [i3]Agata Ciabattoni, Tim Lyon, Revantha Ramanayake, Alwen Tiu:
Display to Labelled Proofs and Back Again for Tense Logics. CoRR abs/1911.02289 (2019) - 2018
- [j8]Revantha Ramanayake:
Inducing syntactic cut-elimination for indexed nested sequents. Log. Methods Comput. Sci. 14(4) (2018) - [j7]Agata Ciabattoni, Francesco A. Genco, Revantha Ramanayake:
Substructural logics: semantics, proof theory, and applications. report on the second SYSMICS workshop. ACM SIGLOG News 5(2): 58-60 (2018) - [c7]Agata Ciabattoni, Tim Lyon, Revantha Ramanayake:
From Display to Labelled Proofs for Tense Logics. LFCS 2018: 120-139 - 2017
- [c6]Agata Ciabattoni, Revantha Ramanayake:
Bunched Hypersequent Calculi for Distributive Substructural Logics. LPAR 2017: 417-434 - [i2]Revantha Ramanayake:
Inducing syntactic cut-elimination for indexed nested sequents. CoRR abs/1703.01356 (2017) - 2016
- [j6]Revantha Ramanayake:
Non-commutative classical arithmetical sequent calculi are intuitionistic. Log. J. IGPL 24(3): 441-452 (2016) - [j5]Agata Ciabattoni, Revantha Ramanayake:
Power and Limits of Structural Display Rules. ACM Trans. Comput. Log. 17(3): 17 (2016) - [c5]Revantha Ramanayake:
From Axioms to Proof Rules, then add Quantifiers. ARQNL@IJCAR 2016: 1-8 - [c4]Revantha Ramanayake:
Inducing Syntactic Cut-Elimination for Indexed Nested Sequents. IJCAR 2016: 416-432 - [i1]Revantha Ramanayake:
A purely syntactic proof of decidability for BI. CoRR abs/1609.05847 (2016) - 2015
- [j4]Revantha Ramanayake:
Embedding the hypersequent calculus in the display calculus. J. Log. Comput. 25(3): 921-942 (2015) - 2014
- [j3]Rajeev Goré, Revantha Ramanayake:
Cut-elimination for Weak Grzegorczyk Logic Go. Stud Logica 102(1): 1-27 (2014) - [j2]Agata Ciabattoni, Revantha Ramanayake, Heinrich Wansing:
Hypersequent and Display Calculi - a Unified Perspective. Stud Logica 102(6): 1245-1294 (2014) - 2013
- [c3]Agata Ciabattoni, Revantha Ramanayake:
Structural Extensions of Display Calculi: A General Recipe. WoLLIC 2013: 81-95 - 2012
- [j1]Rajeev Goré, Revantha Ramanayake:
Valentini's Cut-Elimination for Provability Logic resolved. Rev. Symb. Log. 5(2): 212-238 (2012) - [c2]Rajeev Goré, Revantha Ramanayake:
Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents. Advances in Modal Logic 2012: 279-299
2000 – 2009
- 2008
- [c1]Rajeev Goré, Revantha Ramanayake:
Valentini's cut-elimination for provability logic resolved. Advances in Modal Logic 2008: 67-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
