scientific article; zbMATH DE number 3872671

zbMATH Open0547.68036MaRDI QIDQ3339282FDOQ3339282

Authors: Howard A. Blair 

Publication date: 1984

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

Recommendations

• scientific article; zbMATH DE number 3869303
• Complexity and undecidability results for logic programming
• scientific article; zbMATH DE number 3848602
• A completeness theorem for dynamic logic
• On the Completeness of Dynamic Logic

zbMATH Keywords

dynamic logiclogic programming

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65) Applications of computability and recursion theory (03D80) Undecidability and degrees of sets of sentences (03D35)

Cited In (4)

• Schematic Validity in Dynamic Epistemic Logic: Decidability
• Proof theory for finitely valid sentences
• Verification for everyone? An overview of dynamic logic
• Limitations of the program memory and the expressive power of dynamic logics

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 Q3339282)