Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d… Expand
  • figure 3
  • figure 4
Highly Cited
2009
Highly Cited
2009
This paper has two tightly intertwined aims: (i) to introduce an intuitive and universal graphical calculus for multi-qubit… Expand
  • figure 1
  • table 1
  • table 2
Highly Cited
2008
Highly Cited
2008
First-order logic modulo the theory of integer arithmetic is the basis for reasoning in many areas, including deductive software… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2005
Highly Cited
2005
A neutrosophic set is a part of neutrosophy that studies the origin, nature, and scope of neutralities, as well as their… Expand
  • figure 1.1
  • figure 1.2
  • table 2.1
  • table 2.2
  • figure 2.1
Highly Cited
2004
Highly Cited
2004
Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N- (or… Expand
Highly Cited
1994
Highly Cited
1994
We consider a λ-calculus for which applicative terms have no longer the form (...((u u1) u2)... un) but the form (u [u1;...;un… Expand
Highly Cited
1992
Highly Cited
1992
?0. Prologue. Gentzen's sequent calculus LJ, and its variants such as G3 [21], are (as is well known) convenient as a basis for… Expand
Highly Cited
1989
Highly Cited
1989
  • E. Moggi
  • [] Proceedings. Fourth Annual Symposium on Logic…
  • 1989
  • Corpus ID: 5411355
The lambda -calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses beta… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
1985
Highly Cited
1985
Abstract We prove that, for infinitely many disjunctive normal form propositional calculus tautologies ξ, the length of the… Expand
Highly Cited
1980
Highly Cited
1980
Abstract ‘Non-monotonic’ logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such… Expand
  • figure 3