The power of temporal proofs
From MaRDI portal
Recommendations
- Arithmetical axiomatization of first-order temporal logic
- Completeness theorem for a first order linear-time logic
- Incompleteness of first-order temporal logic with until
- On the interpretability of arithmetic in temporal logic
- A complete axiomatic characterization of first-order temporal logic of linear time
Cites work
- scientific article; zbMATH DE number 3913652 (Why is no real title available?)
- scientific article; zbMATH DE number 3924132 (Why is no real title available?)
- scientific article; zbMATH DE number 3976991 (Why is no real title available?)
- scientific article; zbMATH DE number 3776849 (Why is no real title available?)
- scientific article; zbMATH DE number 1028831 (Why is no real title available?)
- scientific article; zbMATH DE number 1028833 (Why is no real title available?)
- scientific article; zbMATH DE number 1028834 (Why is no real title available?)
- scientific article; zbMATH DE number 1032009 (Why is no real title available?)
- scientific article; zbMATH DE number 3800906 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3325547 (Why is no real title available?)
- scientific article; zbMATH DE number 3200657 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Adequate proof principles for invariance and liveness properties of concurrent programs
- Axioms for tense logic. II: Time periods
- Provability interpretations of modal logic
- Proving Liveness Properties of Concurrent Programs
- The temporal semantics of concurrent programs
Cited in
(28)- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
- Arithmetical axiomatization of first-order temporal logic
- Multi-dimensional logic programming: theoretical foundations
- Specification of abstract dynamic-data types: A temporal logic approach
- Decidability and incompleteness results for first-order temporal logics of linear time
- Similarity saturation for first order linear temporal logic with UNLESS
- The properties of sets of temporal logic subformulas
- A survey on temporal logics for specifying and verifying real-time systems
- Temporal logics need their clocks
- Axiomatisation and decidability of \(F\) and \(P\) in cyclical time
- A decidability result for the model checking of infinite-state systems
- Decidability of infinite-state timed CCP processes and first-order LTL
- Programming in metric temporal logic
- Foundations of linear-time logic programming
- A complete axiomatic characterization of first-order temporal logic of linear time
- scientific article; zbMATH DE number 1536552 (Why is no real title available?)
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- Linear-time temporal logics with Presburger constraints: an overview
- Temporal prophecy for proving temporal properties of infinite-state systems
- The power of the ``always operator in first-order temporal logic
- Completeness Theorems for Temporal Logics TΩ and □TΩ
- LTL over integer periodicity constraints
- scientific article; zbMATH DE number 1536553 (Why is no real title available?)
- Theorem proving using clausal resolution: from past to present
- scientific article; zbMATH DE number 1536551 (Why is no real title available?)
- Temporal abductive reasoning about biochemical reactions
- On the strength of temporal proofs
This page was built for publication: The power of temporal proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118578)
