Work

Complexity of correctness for pomset logic proof nets

Year: 2019

Type: preprint

Abstract: We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1912.10606

Author: Nguyên, Lê Thành Dũng

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3002477419

Cites: 11

Cited by: 1

Related to: 20