# Proof calculus

## Papers overview

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

2010

2010

- RTA
- 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

- SIAM J. Comput.
- 2004

The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning aboutâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- LICS
- 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

- J. ACM
- 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

- Acta Informatica
- 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

- STOC
- 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

- Acta Informatica
- 1985

The object of this paper is to demonstrate how certain tricky mathematical arguments can be encoded as short formal proofs forâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- 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

- STOC
- 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

- STOC
- 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?