Skip to search formSkip to main contentSkip to account menu

Cut rule

In mathematical logic, the cut rule is an inference rule of sequent calculus. It is a generalisation of the classical modus ponens inference rule… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Em teoria da prova, o teorema da eliminacao do corte (ou Hauptsatz, que significa resultado principal) e de suma importância… 
2011
2011
The purpose of speech enhancement techniques is to improve quality and intelligibility of speech without producing any artifact… 
2010
2010
We present a Gentzen system GPDL for Propositional Dynamic Logic, deriving the classical Segerberg axiomatization from our system… 
2007
2007
We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures… 
2004
2004
A common core of proofs of the classical consistency theorem of Hilbert and Ackermann and Herbrand's theorem concerning validity… 
2001
2001
In Zielonka (1981a, 1989), I found an axiomatics for the product-free calculus L of Lambek whose only rule is the cut rule… 
2000
2000
An axiomatics of the product-free syntactic calculus L ofLambek has been presented whose only rule is the cut rule. It was… 
1996
1996
  • E. Eder
  • 1996
  • Corpus ID: 36146959
In backward reasoning, a proof of a theorem is constructed by trying to obtain a set of axioms from the theorem by backward… 
1993
1993
We present in this paper a new type system which allows to extract code for an abstract machine instead of lambda-terms. Thus, we…