Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae

Details Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae

2009-03-31

arxiv.org/abs/0903.5392v1

Computer Science

Computational Complexity

Scientific paper

Jerabek showed that analytic propositional-logic deep-inference proofs can be constructed in quasipolynomial time from nonanalytic proofs. In this work, we improve on that as follows: 1) we significantly simplify the technique; 2) our normalisation procedure is direct, \emph{i.e.}, it is internal to deep inference. The paper is self-contained, and provides a starting point and a good deal of information for tackling the problem of whether a polynomial-time normalisation procedure exists.

Affiliated with

Also associated with

No associations

Rating

Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-20172