Arithmetical Completeness in First-Order Dynamic Logic for Concurrent Programs

  • Hirokazu NlSHIMURA, HlROKAZU NlSHIMURA
  • Published 2005

Abstract

We extend Harel's [4] arithmetical axiomatization P of regular first-order dynamic logic so as to include concurrent programs a///?, and then establish its arithmetical completeness.

Cite this paper

@inproceedings{NlSHIMURA2005ArithmeticalCI, title={Arithmetical Completeness in First-Order Dynamic Logic for Concurrent Programs}, author={Hirokazu NlSHIMURA and HlROKAZU NlSHIMURA}, year={2005} }