64 search results - page 3 / 13 » Cut elimination in coalgebraic logics |
TLCA
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
APAL
2005
13 years 4 months ago
2005
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
IANDC
2000
13 years 4 months ago
2000
