No. Title Author Year
1 Decision Problems for Linear Logic with Least and Greatest Fixed Points Das, Anupam et al. 2022
2 New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial Das, Anupam et al. 2021
3 On the Logical Strength of Confluence and Normalisation for Cyclic Proofs Das, Anupam 2021
4 Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs Buss, Sam et al. 2020
5 A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions Das, Anupam et al. 2018
6 Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices) Das, Anupam et al. 2018
7 Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic Baillot, Patrick et al. 2016
8 No complete linear term rewriting system for propositional logic Das, Anupam et al. 2015
9 Rewriting with Linear Inferences in Propositional Logic Das, Anupam 2013
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI