An Algebraic Approach to Proof Search in Sequent Calculi

@inproceedings{Harland2001AnAA,
  title={An Algebraic Approach to Proof Search in Sequent Calculi},
  author={James Harland},
  year={2001}
}
Inference rules in the sequent calculus can be interpreted as both proof construction rules and proof search rules. However, the kind of information used in each case is somewhat different. In this paper we explore these differences by using a multiple-conclusioned sequent calculus for intuitionistic logic (LM) as a search calculus for proofs in the single-conclusioned intuitionistic sequent calculus LJ. We also show how the classical sequent calculus LK can be considered as both a search… CONTINUE READING

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

On the intuitionistic force of classical search

  • Theor. Comput. Sci.
  • 2000
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Notin, Proof-search and Proof nets in Mixed Linear Logic,Electronic Notes in Theoretical Computer Science

J.M.D. Galmiche
  • 2000
VIEW 1 EXCERPT

Notin, Proof-search and Proof nets in Mixed Linear Logic,Electronic Notes in Theoretical Computer Science

J.M.D. Galmiche
  • 2000
VIEW 1 EXCERPT

Deductive Systems: Principles and Applications. Vol 1: Basic Principles

D. Gabbay, Labelled
  • 1996
VIEW 1 EXCERPT