PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/tableaux/NolletST19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/tableaux/NolletST19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexis_Saurin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Christine_Tasson
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/R%E2%88%9A%C2%A9mi_Nollet
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-030-29026-9%5F18
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-030-29026-9_18
>
dc:
identifier
DBLP conf/tableaux/NolletST19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-030-29026-9%5F18
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
rdfs:
label
PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexis_Saurin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Christine_Tasson
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/R%E2%88%9A%C2%A9mi_Nollet
>
swrc:
pages
317-334
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/tableaux/2019
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/tableaux/NolletST19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/tableaux/NolletST19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/tableaux/tableaux2019.html#NolletST19
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-030-29026-9_18
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/tableaux
>
dc:
title
PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document