scientific article; zbMATH DE number 3858392
From MaRDI portal
Publication:3326828
Recommendations
- scientific article; zbMATH DE number 4021106
- Regular dynamic logic is not interpretable in deterministic context-free dynamic logic
- Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
- ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS
- scientific article; zbMATH DE number 3957062
Cited in
(9)- The unwind property for programs with bounded memory
- Determinization of inverted grammar programs via context-free expressions
- scientific article; zbMATH DE number 3868597 (Why is no real title available?)
- Regular dynamic logic is not interpretable in deterministic context-free dynamic logic
- Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
- scientific article; zbMATH DE number 3957062 (Why is no real title available?)
- Deterministic Algorithms, Simple Languages And One‐to‐One Gentzen Type Formalizations
- scientific article; zbMATH DE number 4021106 (Why is no real title available?)
- Necessary and sufficient conditions for the universality of programming formalisms
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 Q3326828)