Gentzen-type axiomatization for PAL

DOI10.1016/0304-3975(93)90363-XMaRDI QIDQ688720zbMATH OpenFDO

Authors Igor Walukiewicz

Publication date 12 December 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilityaxiomatizationsequent calculuslogic of programspropositional algorithmic logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 18645
• DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations
• scientific article; zbMATH DE number 19783
• scientific article; zbMATH DE number 1114354
• On axiomatizations of PAL

Cites work

• scientific article; zbMATH DE number 3765758 (Why is no real title available?)
• scientific article; zbMATH DE number 1032009 (Why is no real title available?)
• scientific article; zbMATH DE number 3315203 (Why is no real title available?)
• On the Decidability of Propositional Algorithmic Logic
• Propositional dynamic logic of looping and converse is elementarily decidable
• Propositional dynamic logic of regular programs
• Semantical analysis of constructive PDL
• Sequential method in propositional dynamic logic

Cited in

(2)

• DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations
• scientific article; zbMATH DE number 18645 (Why is no real title available?)

This page was built for publication: Gentzen-type axiomatization for PAL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688720)