The incompleteness of Misra and Chandy's proof systems

DOI10.1016/0020-0190(85)90040-7MaRDI QIDQ1064051zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1985

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/6473

zbMATH Keywords

networks of communicating processesrelative completenesstemporal logic

Mathematics Subject Classification ID

Theory of operating systems (68N25) Abstract data types; algebraic specification (68Q65)

Review text

In this paper we show that \textit{J. Misra} and \textit{K. M. Chandy}'s proof systems for networks of communicating processes [cf. e.g. IEEE Trans. Software Eng. SE-7, 417-426 (1981; Zbl 0468.68030)] are incomplete.

Recommendations

• scientific article; zbMATH DE number 1354098
• Remarks on the Incompleteness Proof
• Failure of completeness in proof-theoretic semantics
• scientific article; zbMATH DE number 6845503
• Revisiting Chaitin's incompleteness theorem
• Incompleteness of intuitionistic propositional logic with respect to proof-theoretic semantics
• scientific article; zbMATH DE number 4006256
• On interpreting Chaitin's incompleteness theorem
• On the incompleteness theorems
• Truth, partial logic and infinitary proof systems

Cites work

• scientific article; zbMATH DE number 3928330 (Why is no real title available?)
• Proofs of Networks of Processes

Cited in

(3)

• A model and temporal proof system for networks of processes
• scientific article; zbMATH DE number 4056975 (Why is no real title available?)
• scientific article; zbMATH DE number 591003 (Why is no real title available?)

This page was built for publication: The incompleteness of Misra and Chandy's proof systems

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