On the Decidability of Propositional Algorithmic Logic

DOI10.1002/MALQ.19820281409zbMATH Open0502.03012OpenAlexW2048289337MaRDI QIDQ3967516FDOQ3967516

Bogdan S. Chlebus

Publication date: 1982

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19820281409

zbMATH Keywords

decidabilityaxiomatizationPALlogic of programsalgorithmic logicPDLGentzen-type axiomatization

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Structure of proofs (03F07)

Cited In (3)

• Program-substitution and admissibility of rules in algorithmic logic
• Gentzen-type axiomatization for PAL
• On the computational complexity of satisfiability in propositional logics of programs

This page was built for publication: On the Decidability of Propositional Algorithmic Logic

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