scientific article; zbMATH DE number 4016871

zbMATH Open0626.03020MaRDI QIDQ3028985FDOQ3028985

Volker Weispfenning

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem
• scientific article
• scientific article
• On the Completeness of Dynamic Logic
• Foundations of Software Science and Computation Structures

zbMATH Keywords

compactnesscompletenessaxiomatizabilitysaturated structuresbefore-after behavior of programsdiamond formulasFirst-order dynamic logic QDL

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Cited In (1)

• Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028985)