A proof system for finite trees

Patrick Blackburn, Wilfried Meyer-Viol, Maarten De Rijke

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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 (1994) and Blackburn and Meyer-Viol (1994). We conclude with a proof of the EXPTIMEcompleteness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.

Original languageEnglish
Title of host publicationComputer Science Logic - 9th International Workshop, CSL 1995 Annual Conference of the EACSL, Selected Papers
EditorsHans Kleine Buning
Number of pages20
PublisherSpringer
Publication date1996
Pages86-105
ISBN (Print)3540613773, 9783540613770
DOIs
Publication statusPublished - 1996
Externally publishedYes
Event9th International Workshop on Computer Science Logic, CSL 1995 held as Annual Conference of the European Association for Computer Science, EACSL 1995 - Paderborn, Germany
Duration: 22 Sep 199529 Sep 1995

Conference

Conference9th International Workshop on Computer Science Logic, CSL 1995 held as Annual Conference of the European Association for Computer Science, EACSL 1995
Country/TerritoryGermany
CityPaderborn
Period22/09/199529/09/1995
SponsorEuropean Union, HCM Euroconference Program, University of Paderborn, Universitätsgesellschaft Paderborn
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1092
ISSN0302-9743

Cite this