Abstract
A propositional logic is expressively complete if there is a finite set of connectives which define all truth tables. Kamp (1968, Ph.D. thesis, University of California at Los Angeles), Stavi (1979, unpublished manuscript, Bar-Ilan University, Ramat-Gan, Israel), and Gabbay (1976, "Investigations in Modal and Tense Logics", Reidel, Dordrecht) proved that all Tense Logics over linear time are expressively complete. Here, a constructive method is given to generate time structure whose tense logic is expressively complete from such given models. As a result examples of constructed nonlinear time models yielding functional completeness are also given.
| Original language | English |
|---|---|
| Pages (from-to) | 66-83 |
| Number of pages | 18 |
| Journal | Information and Computation |
| Volume | 72 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1987 |
Fingerprint
Dive into the research topics of 'Preservation of expressive completeness in temporal models'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver