scientific article; zbMATH DE number 3880104

MaRDI QIDQ3345771zbMATH OpenFDO

Authors Ryszard Danecki

Publication date 1984

zbMATH Keywords

decidability problemslooppropositional dynamic logicrecurring domino problemsatisfiability problemundecidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Foundations of Software Science and Computation Structures
• Propositional dynamic logic with recursive programs
• Decision complexity of variants of propositional dynamic logic
• scientific article; zbMATH DE number 4068839
• The propositional dynamic logic of deterministic, well-structured programs

Cited in

(7)

• A modal logic for cyclic repeating
• Looping vs. repeating in dynamic logic
• scientific article; zbMATH DE number 3974282 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Derivatives on graphs for the positive calculus of relations with transitive closure
• Undecidability of the positive calculus of relations with transitive closure and difference: hypothesis elimination using graph loops
• A complete propositional dynamic logic for regular expressions with lookahead

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