To the Decision Problem for Branching Time Logic
First we describe a certain branching time logic. We borrow this logic from Prior (1967) and call it BTL. It is a propositional logic whose formulas are built from propositional symbols by means of usual boolean connectives and additional unary connectives PAST, FUTURE, NECESSARY.
KeywordsDecision Problem Binary Tree Complete Tree Theory Tree Time Logic
Unable to display preview. Download preview PDF.