Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)

DOI10.1016/S0019-9958(85)80002-4zbMath0585.68022MaRDI QIDQ3709863

A. J. Kfoury

Publication date: 1985

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

zbMATH Keywords

programming languagesdynamic logicsunwind propertydeterministic programsnon-deterministic regular (recursive) programs

Mathematics Subject Classification ID

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

Related Items (4)

A simplified proof of \(DDL<DL\) ⋮ Automata on infinite objects and their applications to logic and programming ⋮ Necessary and sufficient conditions for the universality of programming formalisms ⋮ The unwind property for programs with bounded memory

This page was built for publication: Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)