Completeness Proofs for Some Logics of Programs

DOI10.1002/malq.19820280402zbMath0491.03008OpenAlexW2131712674MaRDI QIDQ3952084

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.19820280402

zbMATH Keywords

completenessalgorithmic logicinfinitary axiomatization

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Other infinitary logic (03C75)

Related Items

A complete axiomatic characterization of first-order temporal logic of linear time, On the computational complexity of satisfiability in propositional logics of programs, Étude et implémentation d'un système de déduction pour logique algorithmique