Name
Abstract | ||
|---|---|---|
Proof systems with sequents of the form U proves Phi for proving validity of a propositional modal mu-calculus formula Phi over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel fbr 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 et al. which, in the case of least fixed-point formulae, are applicable to singleton U sets only. AMS Subject Classification. 03B70, 68Q60. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1051/ita:1999124 | RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
fixed point | Analytic proof,Combinatorics,Structural proof theory,Propositional calculus,Least fixed point,Modal logic,Proof complexity,Singleton,Modal,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 4-5 | 0988-3754 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dilian Gurov | 1 | 257 | 26.00 |
| Bruce M. Kapron | 2 | 308 | 26.02 |