Document Zbl 0507.03008

On the elimination of iteration quantifiers in a fragment of algorithmic logic. (English) Zbl 0507.03008

Theor. Comput. Sci. 21, 269-279 (1982).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0507.03008

MSC:

03B45	Modal logic (including the logic of norms)
03B60	Other nonclassical logic
68Q65	Abstract data types; algebraic specification

Keywords:

algorithmic logic; iteration quantifier; normal form

Cite Review PDF

Full Text: DOI Link

References:

[1]	Banachowski, L., Investigations of properties of programs by means of the extended algorithmic logic I, Fund. Inform., 1, 1, 93-119 (1977) · Zbl 0358.68037
[2]	Kreczmar, A., Effectivity problems of algorithmic logic, Fund. Inform., 1, 1, 19-32 (1977) · Zbl 0361.02056
[3]	Mirkowska, G., Algorithmic logic and its applications in the theory of programs I, Fund. Inform., 1, 1, 1-17 (1977) · Zbl 0358.68036
[4]	Mirkowska, G.; Orlowska, E., An elimination of iteration quantifiers in a certain class of algorithmic formulas, Fund. Inform., 1, 3, 347-355 (1978) · Zbl 0386.68043
[5]	Rasiowa, H.; Sikorski, R., Mathematics of Metamathematics, (Monografie Mat., 41 (1963), Polish Scientific Publishers: Polish Scientific Publishers Warsaw) · Zbl 0122.24311
[6]	Salwicki, A., Formalized algorithmic languages, Bull. Acad. Polon. Sci. Sér. Math. Astronom. Phys., 18, 227-232 (1970) · Zbl 0198.02801

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.