Skip to search formSkip to main contentSkip to account menu

Sequent calculus

Known as: Sequent (disambiguation), System LK, Calculus (disambiguation) 
Sequent calculus is, in essence, a style of formal logical argumentation where every line of a proof is a conditional tautology (called a sequent by… 
Wikipedia (opens in a new tab)

Related topics

Related topics

38 relations
Abductive reasoningAdmissible ruleArtificial intelligenceAtomic formula

Broader (1)

Automated theorem proving

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, used for instance to generate program assertions that… 
Highly Cited
2006
Highly Cited
2006
Logic of Violations: A gentzen systems for reasoning with contrary-to-duty obligations
In this paper we present a Gentzen system for reasoning with contrary-to-duty obligations. The intuition behind the system is… 
Highly Cited
2000
Highly Cited
2000
Structural Cut Elimination: I. Intuitionistic and Classical Logic
Abstract We present new variants of known proofs of cut elimination for intuitionistic and classical sequent calculi. In both… 
Highly Cited
2000
Highly Cited
2000
Cut-elimination and Redundancy-elimination by Resolution
A new cut-elimination method for Gentzen?s LK is defined. First cut-elimination is generalized to the problem of redundancy… 
1999
1999
A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic
We give a short proof-theoretic treatment of a terminating contraction-free calculus G4-LC for the zero-order GG odel-Dummett… 
Highly Cited
1999
Highly Cited
1999
ECOOP’ 99 — Object-Oriented Programming
Object-oriented programs [Dahl, Goldberg, Meyer] are notoriously prone to the following kinds of error, which could lead to… 
Highly Cited
1996
Highly Cited
1996
Explicit substitution : on the edge of strong normalisation
Abstract 
Highly Cited
1993
Highly Cited
1993
On the Unity of Logic
1990
1990
A constraint sequent calculus
An axiomatic approach that accounts for examples that come up in logic programming, symbolic computation, affine geometry, and… 
Highly Cited
1977
Highly Cited
1977
On Some Intuitionistic Modal Logics
Some modal logics based on logics weaker than the classical logic have been studied by Fitch [4], Prior [7], Bull [1], [2], [3… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)