Proof calculus

Known as: Calculus (disambiguation), Proof calculi, Proof system 
In mathematical logic, a proof calculus corresponds to a family of formal systems that use a common style of formal inference for its inference rules… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about… (More)
  • figure 1
  • figure 5
  • figure 9
  • figure 10
  • figure 13
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present a proof system for determining satisfaction between processes in a fairly gen eral process algebra and assertions of… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper describes a procedure, based around the construction of tableau proofs, for determining whether finite-state systems… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We show how to construct a public-key cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The object of this paper is to demonstrate how certain tricky mathematical arguments can be encoded as short formal proofs for… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1977
Highly Cited
1977
  • Dexter Kozen
  • 18th Annual Symposium on Foundations of Computer…
  • 1977
Two decidable logical theories are presented, one complete for deterministic polynomial time, one complete for polynomial space… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
The motivation for this work comes from two general sources. The first source is the basic open question in complexity theory of… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
One of the most important open questions in the field of computational complexity is the question of whether there is a… (More)
Is this relevant?