Expressive completeness failure in branching time structures (Q1109759)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4070862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Expressive completeness failure in branching time structures |
scientific article; zbMATH DE number 4070862 |
Statements
Expressive completeness failure in branching time structures (English)
0 references
1987
0 references
As for the expressive completeness problem (or equivalently, functional completeness problem) of tense logics, all the logics over linear time and some over non-linear time structures have already been shown affirmatively by the author and others. Gabbay, on the other hand, has proved that the general time structure is not expressively complete. In this paper, the author extends the negative case by proving that an infinite tree with an unbounded branching factor is not expressively complete.
0 references
tense logic
0 references
branching time
0 references
expressive completeness
0 references
functional completeness
0 references
0 references
0.88057756
0 references
0.87224627
0 references
0.8711205
0 references
0.8706315
0 references
0.86735123
0 references
0 references
0 references
0.8571007
0 references
