Output details
11 - Computer Science and Informatics
University of Bath
Return to search
Output 0 of 0 in the submission
Output title
A quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae
Type
E - Conference contribution
Name of conference/published proceedings
Logic for programming, artificial intelligence, and reasoning: 16th International Conference, LPAR-16, Dakar, Senegal, April 25–May 1, 2010, revised selected papers
Volume number
6355
Issue number
-
First page of article
136
ISSN of proceedings
0302-9743
Year of publication
2010
Number of additional authors
3
Additional information
<11>A large part of the 3-year, £550,000 EPSRC project `Efficient and Natural Proof Systems' in Bath (2013-16, PI: Guglielmi) aims to exploit the opportunities in proof compression brought to
light by this paper. Also, a newly formed collaboration with the University of Turin, via the 2-year, £12,000 Royal Society grant `Sharing and Sequentiality in Proof Systems with Locality' (2012-14, PIs: Guglielmi and Roversi), is in large part devoted to finding computational interpretations of proofs made possible by the sharing mechanism defined in this paper in order to obtain quasipolynomial normalisation.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Mathematical Foundations
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
