论文信息 - Sequential Calculi for Symmetric Dynamic Logic

Sequential Calculi for Symmetric Dynamic Logic

The algorithmic logic of Salwicki (1970, 1977) and dynamic logic of Pratt (1976, 1979) represent a rather successful synthesis of modal logic and Hoare’s (1969) logic. Algorithmic and dynamic logics are of great importance not only in computer science but also in mathematics: Ershov (1983) has shown that dynamic logic is closely related to admissible sets.

Regimantas Pliuškevičius | R. Pliuskevicius

[1] Vaughan R. Pratt,et al. Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[2] Amir Pnueli,et al. A complete axiomatic system for proving deductions about recursive programs , 1977, STOC '77.

[3] Rohit Parikh,et al. The Completeness of Propositional Dynamic Logic , 1978, MFCS.

[4] A. Salwicki. Algorithmic Logic, a Tool for Investigations of Programs , 1977 .

[5] Vaughan R. Pratt,et al. SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[6] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .

[7] Joseph Y. Halpern,et al. Axiomatic definitions of programming languages: a theoretical assessment (preliminary report) , 1980, POPL '80.

[8] Albert R. Meyer,et al. Computability and completeness in logics of programs (Preliminary Report) , 1977, STOC '77.

[9] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.

[10] G. Gentzen. Untersuchungen über das logische Schließen. I , 1935 .