A Note on Negative Tagging for Least Fixed-Point Formulae
Number of Authors: 2
1998 (English)Report (Refereed)
We consider proof systems with sequents of the formU |- F for proving validity of a propositional modal mu-calculus formula F over a set U of states in a given model. Such proof systems usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without having to investigate the history of the proof. Depending on whether tags are used for acceptance or for rejection of a branch in the proof tree, we refer to ``positive'' or ``negative'' tagging, respectively. In their simplest form, tags consist of the sets U at which fixed-point formulae are unfolded. In this paper, we generalise results of earlier work by Andersen, Stirling and Winskel which, in the case of least fixed-point formulae, are applicable to singleton U sets only.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1998, 1. , 13 p.
SICS Technical Report, ISSN 1100-3154 ; T98:03
mu-calculus, proof systems, tagging
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21963OAI: oai:DiVA.org:ri-21963DiVA: diva2:1041505