Author of the publication

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics.

, , and . LICS, page 1-13. IEEE, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Ramanayake, Revantha
add a person with the name Ramanayake, Revantha
 

Other publications of authors with the same name

From Display to Labelled Proofs for Tense Logics., , and . LFCS, volume 10703 of Lecture Notes in Computer Science, page 120-139. Springer, (2018)Inducing Syntactic Cut-Elimination for Indexed Nested Sequents.. IJCAR, volume 9706 of Lecture Notes in Computer Science, page 416-432. Springer, (2016)Sequentialising Nested Systems., , and . TABLEAUX, volume 11714 of Lecture Notes in Computer Science, page 147-165. Springer, (2019)Inducing syntactic cut-elimination for indexed nested sequents.. CoRR, (2017)Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics., , and . LICS, page 1-13. IEEE, (2021)Bounded Sequent Calculi for Non-classical Logics via Hypersequents., , and . TABLEAUX, volume 11714 of Lecture Notes in Computer Science, page 94-110. Springer, (2019)Cut-Restriction: From Cuts to Analytic Cuts., , and . LICS, page 1-13. IEEE, (2023)Bunched Hypersequent Calculi for Distributive Substructural Logics., and . LPAR, volume 46 of EPiC Series in Computing, page 417-434. EasyChair, (2017)Valentini's Cut-Elimination for Provability Logic resolved., and . Rev. Symb. Log., 5 (2): 212-238 (2012)Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq., , and . TABLEAUX, volume 12842 of Lecture Notes in Computer Science, page 299-313. Springer, (2021)