Sciweavers

234 search results - page 2 / 47
» Proof Nets and the Identity of Proofs
Sort
View
CSL
2008
Springer
14 years 12 months ago
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
Paolo Tranquilli
MSCS
2007
117views more  MSCS 2007»
14 years 9 months ago
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
Michele Pagani
AML
2004
78views more  AML 2004»
14 years 10 months ago
Matrix identities and the pigeonhole principle
We show that short bounded-depth Frege proofs of matrix identities, such as P Q = I QP = I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonho...
Michael Soltys, Alasdair Urquhart
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 4 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
14 years 10 months ago
Bijections for Hook Pair Identities
Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally foun...
Christian Krattenthaler