PRESERVATION OF EXPRESSIVE COMPLETENESS IN TEMPORAL MODELS

被引：4

作者：

AMIR, A ^{[1
]}

GABBAY, DM ^{[1
]}

机构：

[1] BAR ILAN UNIV,DEPT MATH & COMP SCI,IL-52100 RAMAT GAN,ISRAEL

来源：

INFORMATION AND COMPUTATION | 1987年 / 72卷 / 01期

关键词：

D O I：

10.1016/0890-5401(87)90051-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A propositional logic is expressively complete if there is a finite set of connectives which define all truth tables. It has been 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.

引用

页码：66 / 83

页数：18