Investigation on fragments of first order branching temporal logic
Various fragments of first-order computational tree logic (\textbf{FOCTL}) are investigated. The fragment of the logic with only the operator \textbf{F} (sometimes in the future) is not axiomatizable. This is shown by a possible embedding of arithmetic into it. The proof can be extended to first-order linear time logic. It is also proved that the logic with the past operator \textbf{H} (always in the past) is not axiomatizable as well. The proof is done by showing that the set of valid formulae of \(\mathbf{FOCTL}_{\mathbf H}\) is \(\Pi^0_2\)-complete. The only axiomatizable fragment is the one with the next operator (\textbf{X}).
- First-order logics of braching time: on expressive power of temporal operators
- scientific article; zbMATH DE number 5790393
- Axiomatizing the monodic fragment of first-order temporal logic
- Decidable fragments of first-order temporal logics
- Decidability and incompleteness results for first-order temporal logics of linear time
This page was built for publication: Investigation on fragments of first order branching temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776809)