Polynomial equivalence among systems LLNC, LLNCa and LLNC0

Autor:	François Métayer
Rok vydání:	1999
Předmět:	Discrete mathematics Combinatorics Propositional variable Single variable General Computer Science Decision problem Equivalence (formal languages) Nuclear Experiment Linear logic Mathematics Theoretical Computer Science Computer Science(all)
Zdroj:	Theoretical Computer Science. 227(1-2):221-229
ISSN:	0304-3975
DOI:	10.1016/s0304-3975(99)00053-5
Popis:	We investigate three fragments of cyclic linear logic, respectively, LLNC containing all propositional variables, LLNC a built on a single variable and the constant-only fragment LLNC 0 . By using non-commutative proofnets, we show that the decision problems of these fragments are polynomially equivalent.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b95a0f5ab541cbb399bd95d80dc8fcd Zobrazit plný text záznamu Full Text from ScienceDirect