P. Blackburn, W. Meyer-Viol, M. de Rijke  Home/Search
Context Related
| cwi.nl/ftp/CWIreports/A...CSR9563.ps.Z coli.unisb.de/pub/coli/cl...claus67.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: info4u.cwi.nl/static/pu...CS1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability ... (Update)
Context of citations to this paper: More
.... is all that s required, it s possible to prove completeness and decidability results for some quite expressive systems; Blackburn and Meyer Viol (1996) supply details. zizo.tex; 17 09 1996; 18:55; no v. p.4 Zooming In, Zooming Out 5 Zo: Still, like the earlier Finger and...
...to add to the tree a relation such that x y i x and y are sisters and x is immediately left of y. Another solution was proposed in [1]. We split into several relations, i , where i is a natural number, such that x i y i x is the ith daughter of y, counting from the...
Cited by: More
A Model for Epistemic Games - Hötte (2004) (Correct)
Halfway between Points and Intervals: A Temporal Logic Based.. - Endriss, Gabbay (2003) (Correct)
Why Combine Logics? - Blackburn, de Rijke (1990) (Correct)
Similar documents (at the sentence level):
73.2%: A Proof System for Finite Trees - Blackburn, Meyer-Viol, de Rijke (1996) (Correct)
Active bibliography (related documents): More All
0.6: Linguistics, Logic, and Finite Trees - Blackburn, Meyer-Viol (Correct)
0.5: Constraint Programming for Natural Language Processing - Duchier (2000) (Correct)
0.2: Model Theoretic Syntax - Cornell, Rogers (1998) (Correct)
Similar documents based on text: More All
1.0: Modal Model Theory - de Rijke (Correct)
0.4: Talking About Trees - Blackburn, Gardent (1993) (Correct)
0.3: Zooming In, Zooming Out - Blackburn, de Rijke (1995) (Correct)
Related documents from co-citation: More All
3: Lexical-Functional Grammar: A Formal System for Grammatical Representation (context) - Kaplan, Bresnan - 1982
2: Complexity of Modal Logics (context) - Spaan - 1993
2: Properties of independently axiomatisable bimodal logics (context) - Kracht, Wolter - 1991
BibTeX entry: (Update)
Patrick Blackburn, Wilfried Meyer-Viol, and Maarten de Rijke. A proof system for finite trees. In Hans Kleine Büning, editor, Computer Science Logic '95, Volume 1092 of Lecture Notes in Computer Science, pages 86--105. Springer, Heidelberg, 1996. http://citeseer.ist.psu.edu/blackburn95proof.html More
@incollection{ blackburn95proof,
author = "Patrick Blackburn and Wilfried Meyer-Viol and Maarten de Rijke",
title = "A proof system for finite trees",
booktitle = "125",
month = "30",
publisher = "Centrum voor Wiskunde en Informatica (CWI)",
address = "ISSN 0169-118X",
pages = "19",
year = "1995",
url = "citeseer.ist.psu.edu/blackburn95proof.html" }
Citations (may not include all citations):241 Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
114 Fundamental properties of infinite trees (context) - Courcelle - 1985
59 Models of program logics (context) - Pratt - 1979
54 Complexity of Modal Logics (context) - Spaan - 1993
52 Center for the Study of Language and Information (context) - Goldblatt, Time et al. - 1992
32 Talking about trees - Blackburn, Gardent et al. - 1993
27 Studies in the Logic of Trees with Applications to Grammar F.. (context) - Rogers - 1994
23 A selective undo mechanism for graphical user interfaces on .. - Berlage - 1994
12 Self Reference and Modal Logic (context) - Smory'nski - 1985
10 Mathematical Aspects of command relations - Kracht - 1993
9 logic and finite trees (context) - Blackburn, Meyer-Viol - 1994
7 Language and Information (context) - Kracht, grammar et al. - 1995
5 Complete axiomatisations of the algebras of finite (context) - Maher - 1988
4 A specification language for lexical functional grammars - Blackburn, Gardent - 1995
2 Logical Semantics of Programming (context) - van Benthem, Meyer-Viol
2 A first-order axiomatisation of the theory of finite trees (context) - Backofen, Rogers et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://info4u.cwi.nl/static/publications/reports/CS-1995.html): More
Ntyft/ntyxt Rules Reduce to Ntree Rules - Fokkink, van Glabbeek (1996) (Correct)
Equational Term Graph Rewriting - Ariola, Klop (1993) (Correct)
Raising GA Performance by Simultaneous Tuning of.. - van Kemenade, Kok, Eiben (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC