# Cut rule

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- CSL
- 2013

One of the authors introduced in [16] a calculus of circular proofs for studying the computability arising from the followingâ€¦Â (More)

Is this relevant?

2011

2011

- Science China Information Sciences
- 2011

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

- Logical Methods in Computer Science
- 2011

The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-formâ€¦Â (More)

Is this relevant?

2008

2008

- GMP
- 2008

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)

Is this relevant?

2008

2008

- J. Log. Algebr. Program.
- 2008

Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely onâ€¦Â (More)

Is this relevant?

2004

2004

- Theor. Comput. Sci.
- 2004

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

- Journal of Logic, Language and Information
- 2001

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

- Mathematical Structures in Computer Science
- 2001

We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deductionâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Journal of Automated Reasoning
- 1994

In this paper techniques are developed and compared that increase the inferential power of tableau systems for classical firstâ€¦Â (More)

Is this relevant?

1992

1992

- Arch. Math. Log.
- 1992

The central theorem of Gentzen's theory of proofs states that every deduction d (in classical or intuitionistic, propositional orâ€¦Â (More)

Is this relevant?