Studia Logica

, Volume 88, Issue 2, pp 247–261

Decidable Cases of First-order Temporal Logic with Functions

Article

DOI: 10.1007/s11225-008-9104-y

Cite this article as:
Hussak, W. Stud Logica (2008) 88: 247. doi:10.1007/s11225-008-9104-y
  • 47 Downloads

Abstract

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 enumerable. However, the monadic monodic fragment with rigid functions, where no two distinct terms have variables bound by the same quantifier, is decidable and EXPSPACE-complete.

Keywords

first-order temporal logic monodic fragment predicate logic with functions decidability 

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of Computer ScienceLoughborough UniversityLoughboroughUK

Personalised recommendations