Quadratic Correctness Criterion for Non-commutative Logic | Zendy

Virgile Mogbil | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Quadratic Correctness Criterion for Non-commutative Logic

Author(s) -

Virgile Mogbil

Publication year - 2001

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-42554-3

DOI - 10.1007/3-540-44802-0_6

Subject(s) - correctness , multiplicative function , commutative property , computer science , fragment (logic) , quadratic equation , linear logic , proof theory , algorithm , mathematics , discrete mathematics , theoretical computer science , mathematical analysis , geometry , mathematical proof

The multiplicative fragment of Non commutative Logic (called MNL) has a proof nets theory [AR00] with a correctness criterion based on long trips for cut-free proof nets. Recently, R. Maieli has developed another criterion in the Danos-Regnier style [Mai00]. Both are in exponential time. We give a quadratic criterion in the Danos contractibility criterion style.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research