IndexBrowse   BibliographiesMy selection
 Search: in   (word length ≥ 3)
Reference no #211   Download bibtex file Type :   Html | Bib | Both
    Created: 2007-12-12 11:30:28
211 Add to my selection
      AUTHOR = {Blackburn, Patrick and Meyer-Viol, Wilfried and de Rijke, Maarten},
      TITLE = {A Proof System for Finite Trees},
      YEAR = {1995},
      MONTH = {October},
      NUMBER = {67},
      PAGES = {19},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {},
      ABSTRACT = {In this paper we introduce a description language for finite trees. Although we briefly 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 satisfiability problem, and a discussion of issues related to complexity and theorem proving.},
      ANNOTE = {COLIURL : Blackburn:1995:PSFb.pdf}
Last modified: Thu October 16 2014 19:11:34         BibAdmin