An Axiomatization of a First-order Branching Time Temporal Logic

We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic

An Axiomatization of a First-order Branching Time Temporal Logic

Abstract: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic. Key Words: branching time logic, first order logic, strong completenes