PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points (Q2180526)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points |
scientific article |
Statements
PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points (English)
0 references
14 May 2020
0 references
sequent calculus
0 references
non-wellfounded proofs
0 references
circular proofs
0 references
induction
0 references
coinduction
0 references
fixed points
0 references
linear logic
0 references
\(\mu\mathrm{MLL}\)
0 references
size-change
0 references
PSPACE-complete
0 references
complexity
0 references
