Decidable cases of first-order temporal logic with functions

We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be decided with EXPSPACE-complete complexity. A single rigid function is sufficient to make the logic not recursively enumerab...

Full description

Saved in:
Bibliographic Details
Main Author: Walter Hussak
Format: Default Article
Published: 2008
Subjects:
Other information and computing sciences not elsewhere classified
First-order temporal logic
Monodic fragment
Predicate logic with functions
Decidability
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/3270
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items