Completeness theorem for a first order linear-time logic
From MaRDI portal
Publication:2913981
Recommendations
- Arithmetical axiomatization of first-order temporal logic
- scientific article; zbMATH DE number 5790393
- Decidability and incompleteness results for first-order temporal logics of linear time
- A complete axiomatic characterization of first-order temporal logic of linear time
- scientific article; zbMATH DE number 1678387
Cited in
(15)- A PSPACE-complete first-order fragment of computability logic
- Arithmetical axiomatization of first-order temporal logic
- Incompleteness of a first-order Gödel logic and some temporal logics of programs
- Decidability and incompleteness results for first-order temporal logics of linear time
- Weak completeness theorem for propositional linear time temporal logic
- Probability logics for reasoning about quantum observations
- The logic of ``initially and ``next: complete axiomatization and complexity
- scientific article; zbMATH DE number 5238362 (Why is no real title available?)
- The power of temporal proofs
- A complete axiomatic characterization of first-order temporal logic of linear time
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- scientific article; zbMATH DE number 1088203 (Why is no real title available?)
- Concerning the semantic consequence relation in first-order temporal logic
- Incompleteness in linear time
- scientific article; zbMATH DE number 1405444 (Why is no real title available?)
This page was built for publication: Completeness theorem for a first order linear-time logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913981)
