On the Decidability of Propositional Algorithmic Logic

From MaRDI portal

Revision as of 00:17, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3967516

Jump to:navigation, search

DOI10.1002/malq.19820281409zbMath0502.03012OpenAlexW2048289337MaRDI QIDQ3967516

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

decidability axiomatization PAL logic of programs algorithmic logic PDL Gentzen-type axiomatization

Mathematics Subject Classification ID

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

Related Items (3)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3967516&oldid=17675038"