Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
From MaRDI portal
Recommendations
Cited in
(22)- Two most nondeterministic programs
- The unwind property for programs with bounded memory
- A nondeterministic program logic
- A simplified proof of \(DDL<DL\)
- scientific article; zbMATH DE number 3845026 (Why is no real title available?)
- scientific article; zbMATH DE number 3858392 (Why is no real title available?)
- scientific article; zbMATH DE number 3868597 (Why is no real title available?)
- Nontrivial definability by flow-chart programs
- scientific article; zbMATH DE number 3880106 (Why is no real title available?)
- scientific article; zbMATH DE number 4200180 (Why is no real title available?)
- scientific article; zbMATH DE number 3928341 (Why is no real title available?)
- A programming language for the inductive sets, and applications
- scientific article; zbMATH DE number 3957062 (Why is no real title available?)
- scientific article; zbMATH DE number 3967908 (Why is no real title available?)
- scientific article; zbMATH DE number 4021106 (Why is no real title available?)
- scientific article; zbMATH DE number 4049005 (Why is no real title available?)
- scientific article; zbMATH DE number 4100595 (Why is no real title available?)
- scientific article; zbMATH DE number 139633 (Why is no real title available?)
- scientific article; zbMATH DE number 5244180 (Why is no real title available?)
- Automata on infinite objects and their applications to logic and programming
- Necessary and sufficient conditions for the universality of programming formalisms
- Equivalences among logics of programs
This page was built for publication: Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709863)