Sciweavers

351 search results - page 10 / 71
» Classical proof forestry
Sort
View
JCT
2011
55views more  JCT 2011»
13 years 2 months ago
A Pieri rule for skew shapes
The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product ...
Sami H. Assaf, Peter R. W. McNamara
JANCL
2006
100views more  JANCL 2006»
13 years 7 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
KI
2009
Springer
14 years 2 months ago
Presenting Proofs with Adapted Granularity
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...
Marvin Schiller, Christoph Benzmüller
STACS
2001
Springer
13 years 12 months ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan
MSCS
2007
125views more  MSCS 2007»
13 years 7 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym