Gentzen-Type Axiomatization for PAL

Abstract

Propositional algorithmic logic (PAL) was constructed by Mirkowska [4] as a propositional counterpart of algorithmic logic (AL) [7]. The aim of PAL is to investigate the properties of simple nondeterministic while-programs built upon the set of atomic actions on a propositional level abstracting from values of variables, functions, etc. As opposed to PDL… (More)
DOI: 10.1016/0304-3975(93)90363-X

Topics

Cite this paper

@article{Walukiewicz1993GentzenTypeAF, title={Gentzen-Type Axiomatization for PAL}, author={Igor Walukiewicz}, journal={Theor. Comput. Sci.}, year={1993}, volume={118}, pages={67-79} }