[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/lics/AehligB08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Arnold_Beckmann>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Klaus_Aehlig>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FLICS.2008.9>
foaf:homepage <https://doi.org/10.1109/LICS.2008.9>
dc:identifier DBLP conf/lics/AehligB08 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FLICS.2008.9 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
rdfs:label On the Computational Complexity of Cut-Reduction. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Arnold_Beckmann>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Klaus_Aehlig>
swrc:pages 284-293 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/lics/2008>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/lics/AehligB08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/lics/AehligB08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/lics/lics2008.html#AehligB08>
rdfs:seeAlso <https://doi.org/10.1109/LICS.2008.9>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/lics>
dc:subject cut-reduction, proof notations, propositional logic, Bounded Arithmetic (xsd:string)
dc:title On the Computational Complexity of Cut-Reduction. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document