Anupam Das 'Ecole Normale Sup'erieure de Lyon

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Abstract. We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore logical information. As results we obtain a polynomial simulation of versions of Resolution, along(More)
  • 1