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… (More)
Wikipedia

Related topics

Related topics

2 relations
Admissible ruleSequent calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Cuts for circular proofs: semantics and cut-elimination
One of the authors introduced in [16] a calculus of circular proofs for studying the computability arising from the following… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2011
2011
R-calculus without the cut rule
R-calculus is an inference system for deducing all possible changes when a theory is refuted by the facts. In this paper, we try… (More)
Is this relevant?
2011
2011
The Structure of Differential Invariants and Differential Cut Elimination
The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-form… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Meaningful Mesh Segmentation Guided by the 3D Short-Cut Rule
Extended from the 2D silhouette-parsing short-cut rule [25], a 3D short-cut rule, which states “ as long as a cutting path mainly… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
On the relationship between compact regularity and Gentzen's cut rule
The patch topology on a stably compact space, generalizing the Lawson topology on a domain, is a core+ection of stably compact… (More)
Is this relevant?
2001
2001
Cut-Rule Axiomatization of the Syntactic Calculus L0
In Zielonka (1981a, 1989), I found an axiomatics for the product-free calculus L of Lambek whose only rule is the cut rule… (More)
Is this relevant?
2001
2001
Cut rules and explicit substitutions
We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deduction… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Controlled integration of the cut rule into connection tableau calculi
In this paper techniques are developed and compared that increase the inferential power of tableau systems for classical first… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Bounds for cut elimination in intuitionistic propositional logic
The central theorem of Gentzen's theory of proofs states that every deduction d (in classical or intuitionistic, propositional or… (More)
Is this relevant?