Abstract
Little is known about the expressive completeness of connectives in temporal logic systems with a nonlinear time model. We introduce separation-a general tool for proving completeness in nonlinear time models. We then use the separation theorem to show expressive completeness of a finite set of connectives in various branching time models.
| Original language | English |
|---|---|
| Pages (from-to) | 177-203 |
| Number of pages | 27 |
| Journal | Information and control |
| Volume | 66 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 1985 |
| Externally published | Yes |
Bibliographical note
Funding Information:* This work was done while the author was at Bar-Ilan University, Ramat-Gan, Israel, and partially supported by the Rekanati Foundation.
Funding
* This work was done while the author was at Bar-Ilan University, Ramat-Gan, Israel, and partially supported by the Rekanati Foundation.
| Funders | Funder number |
|---|---|
| Rekanati Foundation |