1274 search results - page 6 / 255 » New Proofs for |
COMBINATORICA
1999
13 years 7 months ago
1999
STACS
2001
Springer
13 years 12 months ago
2001
Springer
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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof ...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...