63 search results - page 6 / 13 » Short proofs of strong normalization |
LOGCOM
2010
13 years 5 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
ENTCS
2002
13 years 10 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
AFRICACRYPT
2010
Springer
14 years 3 months ago
2010
Springer
the full version of the extended abstract which appears in Africacrypt ’10 (3 – 6 may 2010, Stellenbosch, South Africa) D. Bernstein and T. Lange Eds., Springer-Verlag, LNCS 60...
TLCA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...