Theoretical Computer Science
New foundations for the geometry of interaction
Information and Computation
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Basic proof theory
Coherence completions of categories
Theoretical Computer Science - Special issue on linear logic, 1
Theorem Proving via General Matings
Journal of the ACM (JACM)
Fast Cut-Elimination by Projection
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Handsome proof-nets: perfect matchings and cographs
Theoretical Computer Science - Linear logic
Full Completeness of the Multiplicative Linear Logic of Chu Spaces
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Correctness of Multiplicative Proof Nets is Linear
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Geometry of deduction via graphs of proofs
Logic for concurrency and synchronisation
On the Geometry of Interaction for Classical Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Constructing Free Boolean Categories
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Proof nets for unit-free multiplicative-additive linear logic
ACM Transactions on Computational Logic (TOCL)
Categorical proof theory of classical propositional calculus
Theoretical Computer Science - Logic, language, information and computation
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Information and Computation
Expansion nets: proof-nets for propositional classical logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Proof Nets for Herbrand’s Theorem
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |
Proofs Without Syntax [Hughes, D.J.D. Proofs Without Syntax. Annals of Mathematics 2006 (to appear), http://arxiv.org/abs/math/0408282 (v3). August 2004 submitted version also available: [35]] introduced polynomial-time checkable combinatorial proofs for classical propositional logic. This sequel approaches Hilbert's 24^t^hProblem with combinatorial proofs as abstract invariants for sequent calculus proofs, analogous to homotopy groups as abstract invariants for topological spaces. The paper lifts a simple, strongly normalising cut elimination from combinatorial proofs to sequent calculus, factorising away the mechanical commutations of structural rules which litter traditional syntactic cut elimination. Sequent calculus fails to be surjective onto combinatorial proofs: the paper extracts a semantically motivated closure of sequent calculus from which there is a surjection, pointing towards an abstract combinatorial refinement of Herbrand's theorem.