A Proof System for Finite Trees

@inproceedings{Blackburn1995APS,
  title={A Proof System for Finite Trees},
  author={Patrick Blackburn and Wilfried Meyer-Viol and Maarten de Rijke},
  booktitle={CSL},
  year={1995}
}
In this paper we introduce a description language for nite trees Although we brie y note some of its intended applications the main goal of the paper is to provide it with a sound and complete proof system We do so using standard axioms from modal provability logic and modal logics of programs and prove completeness by extending techniques due to Van Benthem and Meyer Viol and Blackburn and Meyer Viol We conclude with a proof of the EXPTIME completeness of the satis ability problem and a… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
23 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Self Reference and Modal Logic

  • C. nski
  • 1985
Highly Influential
4 Excerpts

A first - order axiomatisation of the theory of finite trees

  • R. Backofen, J. Rogers
  • Journal of Logic , Language and Information
  • 1995

A rst - order axiomatisation of the theoryof nite trees

  • J. van Benthem, W. Meyer-Viol
  • Journal of Logic , Language and Information
  • 1995

Linguistics , logic and nite trees

  • P. Blackburn, C. Gardent
  • Bulletin of the IGPL 2 : 2 { 29 ,
  • 1994

Similar Papers

Loading similar papers…