On the strength of temporal proofs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3650541 (Why is no real title available?)
- scientific article; zbMATH DE number 3856389 (Why is no real title available?)
- scientific article; zbMATH DE number 4139719 (Why is no real title available?)
- scientific article; zbMATH DE number 3924132 (Why is no real title available?)
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 3979058 (Why is no real title available?)
- scientific article; zbMATH DE number 4033710 (Why is no real title available?)
- scientific article; zbMATH DE number 3703966 (Why is no real title available?)
- scientific article; zbMATH DE number 3705899 (Why is no real title available?)
- scientific article; zbMATH DE number 3776849 (Why is no real title available?)
- scientific article; zbMATH DE number 17797 (Why is no real title available?)
- scientific article; zbMATH DE number 19762 (Why is no real title available?)
- scientific article; zbMATH DE number 3628347 (Why is no real title available?)
- scientific article; zbMATH DE number 3632451 (Why is no real title available?)
- scientific article; zbMATH DE number 3637823 (Why is no real title available?)
- scientific article; zbMATH DE number 1354161 (Why is no real title available?)
- scientific article; zbMATH DE number 3999893 (Why is no real title available?)
- scientific article; zbMATH DE number 4119617 (Why is no real title available?)
- scientific article; zbMATH DE number 3800906 (Why is no real title available?)
- A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATION
- A complete logic for reasoning about programs via nonstandard model theory. II
- A completeness theorem for dynamic logic
- A simple proof for the completeness of Floyd's method
- An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic
- Cylindric algebras. Part II
- Determinateness of program equivalence over peano axioms
- First-order dynamic logic
- Handbook of philosophical logic. Vol. 9
- Non-standard algorithmic and dynamic logic
- On the termination of program schemas
- Programs and program verifications in a general setting
- Recursive programs and denotational semantics in absolute logics of programs
- STRUCTURED NONSTANDARD DYNAMIC LOGIC
- Temporal logics need their clocks
- The power of temporal proofs
- To the memory of Arthur Prior Formal properties of ‘now’
- Total correctness in nonstandard logics of programs
- Weak second order characterizations of various program verification systems
Cited in
(9)- Derivation rules as anti-axioms in modal logic
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- scientific article; zbMATH DE number 17797 (Why is no real title available?)
- scientific article; zbMATH DE number 18642 (Why is no real title available?)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
- Incompleteness of first-order temporal logic with until
- On the axiomatizability of some first-order spatio-temporal theories
- Lambek calculus and its relational semantics: Completeness and incompleteness
- Temporal logics need their clocks
This page was built for publication: On the strength of temporal proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809066)