14 search results - page 2 / 3 » Structural Cut Elimination: I. Intuitionistic and Classical ... |
CSR
2008
Springer
13 years 6 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
ESOP
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
JAR
2010
13 years 4 months ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
LPAR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
TLCA
2005
Springer
13 years 11 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. ...