On Binary Computation Structures

✍ Scribed by Bernhard Heinemann

• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 696 KB
• Volume: 43
• Category: Article
• ISSN: 0044-3050
• DOI: 10.1002/malq.19970430205

✦ Synopsis

Abstract

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.