3 papers
math.LO2024
Rule-Elimination Theorems
Sayantan Roy
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system …
cs.CR2023
Obfuscation of Discrete Data
Saswata Naha, Sayantan Roy, Arkaprava Sanki +1
Data obfuscation deals with the problem of masking a data-set in such a way that the utility of the data is maximized while minimizing the risk of the disclosure of sensitive infor…
math.LO2021
Negation-Free Definitions of Paraconsistency
Sankha S. Basu, Sayantan Roy
Paraconsistency is commonly defined and/or characterized as the failure of a principle of explosion. The various standard forms of explosion involve one or more logical operators o…