Gentzen-type axiomatization for PAL

DOI10.1016/0304-3975(93)90363-XzbMATH Open0783.68084MaRDI QIDQ688720FDOQ688720

Authors: Igor Walukiewicz 

Publication date: 12 December 1993

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

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

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)

Cites Work

• Propositional dynamic logic of regular programs
• Propositional dynamic logic of looping and converse is elementarily decidable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential method in propositional dynamic logic
• Semantical analysis of constructive PDL
• Title not available (Why is that?)
• On the Decidability of Propositional Algorithmic Logic

Cited In (2)

• Title not available (Why is that?)
• DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations

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)