Nontrivial definability by flow-chart programs

DOI10.1016/S0019-9958(83)80057-6MaRDI QIDQ3345746zbMATH OpenFDO

Authors Paweł Urzyczyn

Publication date 1983

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(83)80057-6

zbMATH Keywords

deterministic dynamic logicfirst-order formulasflow-chart programsloop-free

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
• scientific article; zbMATH DE number 3848600
• Necessary and sufficient conditions for the universality of programming formalisms
• Equivalences among logics of programs
• Algebraic characterization of reducible flowcharts

Cited in

(6)

• The unwind property for programs with bounded memory
• Some relationships between logics of programs and complexity theory
• A simplified proof of \(DDL<DL\)
• scientific article; zbMATH DE number 4201627 (Why is no real title available?)
• scientific article; zbMATH DE number 3928354 (Why is no real title available?)
• Necessary and sufficient conditions for the universality of programming formalisms

This page was built for publication: Nontrivial definability by flow-chart programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345746)