Sciweavers

234 search results - page 4 / 47
» Deduction, Strategies, and Rewriting
Sort
View
TLCA
2005
Springer
14 years 1 months ago
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
Olivier Hermant
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
A comparison between two logical formalisms for rewriting
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino
ENTCS
2002
111views more  ENTCS 2002»
13 years 7 months ago
Comparing Meseguer's Rewriting Logic with the Logic CRWL
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino Tarjuelo
IANDC
2010
141views more  IANDC 2010»
13 years 6 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Issam Maamria, Michael Butler