Sciweavers

877 search results - page 8 / 176
» Structural Cut Elimination
Sort
View
TLCA
1999
Springer
13 years 11 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
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...
Christian Urban, Gavin M. Bierman
BIRTHDAY
2008
Springer
13 years 9 months ago
Proof Search Tree and Cut Elimination
Grigori Mints
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Cut Elimination for a Logic with Induction and Co-induction
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...
Alwen Tiu, Alberto Momigliano
APAL
2005
117views more  APAL 2005»
13 years 7 months ago
About cut elimination for logics of common knowledge
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,...
Luca Alberucci, Gerhard Jäger
ENTCS
2002
66views more  ENTCS 2002»
13 years 7 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel