In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely relatedâ€¦Â (More)

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

2010

2010

- Taus Brock-Nannestad, Carsten SchÃ¼rmann
- LPAR
- 2010

Natural deduction for intuitionistic linear logic is known to be full of non-deterministic choices. In order to control theseâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Michel Parigot
- 2005

1 INTRODUCTION This paper presents a way of extending the paradigm "proofs as programs" to classical proofs. The system we use isâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Patrick Blackburn
- J. Log. Comput.
- 2000

This paper shows how to internalize the Kripke satisfaction definition using the basic hybrid language, and explores the proofâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Edmund M. Clarke, Somesh Jha, Wilfredo R. Marrero
- PROCOMET
- 1998

As more resources are added to computer networks, and as more vendors look to the World Wide Web as a viable marketplace, theâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Michel Parigot
- LICS
- 1993

In this paper we prove the strong normalization theorem for second order classical natural deduction. The method used is anâ€¦Â (More)

Is this relevant?

1993

1993

The goal of this paper is to present a theorem prover able to perform both forward and backward reasoning supported by a wellâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- categoriesR. F. Blute, J. R. B. Cockett, R. A. G. Seely, Thomas Trimble
- 1991

This paper examines coherence for certain monoidal categories using techniques coming from the proof theory of linear logic, inâ€¦Â (More)

Is this relevant?

1991

1991

- Giuseppe Longo, Eugenio Moggi
- Mathematical Structures in Computer Science
- 1991

Mathematical Structures in Computer Science / Volume 1 / Issue 02 / July 1991, pp 215 254 DOI: 10.1017/S0960129500001298â€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Lawrence C. Paulson
- J. Log. Program.
- 1986

An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function forâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- Peter Schroeder-Heister
- J. Symb. Log.
- 1984

One of the main ideas of calculi of natural deduction, as introduced by Jaskowski and Gentzen, is that assumptions may beâ€¦Â (More)

Is this relevant?