On the logical complexity of cyclic arithmetic

Anupam Das. Preprint. PDF

We study the logical complexity of proofs in cyclic arithmetic, as introduced by Simpson, in terms of quantifier alternations of formulae occurring. Writing for (the logical consequences of) cyclic proofs containing only formulae, we show for : over sequents. This is obtained by proof theoretic techniques, relying on normal forms and structural manipulations of Peano …

A cut-free cyclic proof system for Kleene algebra

Anupam Das and Damien Pous. In proceedings of Tableaux '17. DOI HAL PDF

We introduce a sound non-wellfounded proof system whose regular (or ‘cyclic’) proofs are complete for (in)equations between regular expressions. We achieve regularity by using hypersequents rather than usual sequents, with more structure in the succedent, and relying on the discreteness of rational languages to drive proof search. By inspection of the proof search space we …

Alternating time bounds from variants of focussed proof systems

Anupam Das. Preprint. PDF

Intuitionistic logic and the polynomial hierarchy We conduct a complexity-theoretic study of focussed proof systems, relating the alternation of synchronous and asynchronous phases in a proof to an appropriate alternating time hierarchy, for instance the polynomial hierarchy. We propose a notion of ‘over-focussing’ that admits non-branching invertible rules during synchronous phases, due to the fact …

On linear rewriting systems for Boolean logic and some applications to proof theory

Anupam Das and Lutz Straßburger. Logical Methods in Computer Science. Special issue of selected papers from RTA and TLCA '15. DOI arXiv PDF

Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can be written as a (left- and right-)linear rewrite rule. In this paper we study properties of …

Free-cut elimination in linear logic and an application to a feasible arithmetic

Patrick Baillot and Anupam Das. In proceedings of CSL '16. DOI HAL PDF

We prove a general form of ‘free-cut elimination’ for first-order theories in linear logic, yielding normal forms of proofs where cuts are anchored to nonlogical steps. To demonstrate the usefulness of this result, we consider a version of arithmetic in linear logic, based on a previous axiomatisation by Bellantoni and Hofmann. We prove a witnessing …

From positive and intuitionistic bounded arithmetic to monotone proof complexity

Anupam Das. In proceedings of LICS '16. DOI PDF

We study versions of second-order bounded arithmetic where induction and comprehension formulae are positive or where the underlying logic is intuitionistic, examining their relationships to monotone and deep inference proof systems for propositional logic. In the positive setting a restriction of a Paris-Wilkie (PW) style translation yields quasipolynomial-size monotone propositional proofs from Π01 arithmetic theorems, …

On nested sequents for constructive modal logics

Ryuta Arisaka, Anupam Das and Lutz Straßburger. Logical Methods in Computer Science. DOI arXiv PDF

We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the standard modal logics K4, S4, and S5. We use for our presentation the formalism …

A complete axiomatization of MSO on infinite trees

Anupam Das and Colin Riba. In proceedings of LICS '15. DOI PDF

We show that an adaptation of Peano’s axioms for second-order arithmetic to the language of MSO completely axiomatizes the theory over infinite trees. This continues a line of work begun by Büchi and Siefkes with axiomatizations of MSO over various classes of linear orders. Our proof formalizes, in the axiomatic theory, a translation of MSO …