Nondeterministic program schemata and their relation to dynamic logic

DOI10.1007/BF01132079zbMath0692.68012OpenAlexW4254082568MaRDI QIDQ3034804

N. V. Shilov, V. A. Nepomnyashchij

Publication date: 1988

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01132079

zbMATH Keywords

algorithmdecidabilityYanov schema

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Cites Work

• Unnamed Item
• Simple program schemes and formal languages
• Propositional dynamic logic of looping and converse is elementarily decidable

This page was built for publication: Nondeterministic program schemata and their relation to dynamic logic