Decidable cases of first-order temporal logic with functions
From MaRDI portal
Publication:2426731
DOI10.1007/s11225-008-9104-yzbMath1142.03011OpenAlexW2039504806MaRDI QIDQ2426731
Publication date: 23 April 2008
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-008-9104-y
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Decidable fragments of first-order temporal logics
- Decidability of infinite-state timed CCP processes and first-order LTL
- Equality and monodic first-order temporal logic
- Monodic packed fragment with equality is decidable
- A Practical Decision Procedure for Arithmetic with Function Symbols
This page was built for publication: Decidable cases of first-order temporal logic with functions