Pages that link to "Item:Q1158956"
From MaRDI portal
The following pages link to Axiomatising the logic of computer programming (Q1158956):
Displayed 23 items.
- Dynamic extensions of arrow logic (Q598299) (← links)
- An essay in combinatory dynamic logic (Q809068) (← links)
- Notes on logics of metric spaces (Q878157) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Strong completeness and limited canonicity for PDL (Q1006490) (← links)
- Erratum to: ``Strong completeness and limited canonicity for PDL'' (Q1016034) (← links)
- Infinitary propositional normal modal logic (Q1102267) (← links)
- Determinism and non-determinism in PDL (Q1177157) (← links)
- Axiomatizing fixpoint logics (Q1190508) (← links)
- Getting started: Beginnings in the logic of action (Q1207426) (← links)
- Action incompleteness (Q1207435) (← links)
- Modal logic with names (Q1310624) (← links)
- A model existence theorem in infinitary propositional modal logic (Q1332142) (← links)
- A dynamic logic of action (Q1337608) (← links)
- Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630) (← links)
- Logic of transition systems (Q1895974) (← links)
- A logical framework for evolving software systems (Q1911313) (← links)
- PDL with intersection of programs: a complete axiomatization (Q3643256) (← links)
- Complete Axiomatization of a Relative Modal Logic with Composition and Intersection (Q4236070) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- Hyperboolean Algebras and Hyperboolean Modal Logic (Q4531582) (← links)
- A case study in the mechanical verification of fault tolerance (Q4783363) (← links)