scientific article
From MaRDI portal
Publication:3483264
zbMath0704.03011MaRDI QIDQ3483264
V. A. Nepomniaschy, N. V. Shilov
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilitypropositional dynamic logicvalidity problemcomplexity of the halting problem for nondeterministic Yanov schemata
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Program schemata vs. automata for decidability of program logics, Program schemata technique for propositional program logics: a 30-year history