1 citations · 1 across the 4 of their papers we have counts for
4 papers
Hypersequent Calculi Have Ackermannian Complexity
A. R. Balasubramanian, Vitor Greati, Revantha Ramanayake
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on (Dickson's lemma), yi…
Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
Amirhossein Akbar Tabatabai, Vitor Greati, Revantha Ramanayake
Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this re…
Complexities of Well-Quasi-Ordered Substructural Logics
Nikolaos Galatos, Vitor Greati, Revantha Ramanayake +1
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity),…
Deducibility in the full Lambek calculus with weakening is HAck-complete
Vitor Greati, Revantha Ramanayake
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level…