Positive program logics in systems with arithmetic

DOI10.1007/BF01072166MaRDI QIDQ3718148zbMATH OpenOpenAlexFDO

Authors I. Kh. Musikaev, Alexei P. Stolboushkin

Publication date 1984

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01072166

zbMATH Keywords

algebraic system with arithmeticdynamic logicexpressive powerrecursively enumerable logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Equivalences among logics of programs
• scientific article; zbMATH DE number 3846863
• Some open questions in the theory of program schemes and dynamic logics
• Limitations of the program memory and the expressive power of dynamic logics
• ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS

Cites work

• First-order dynamic logic

Cited in

(5)

• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Positive Arithmetic Without Exchange Is a Subclassical Logic
• Unbounded program memory adds to the expressive power of first-order programming logic
• scientific article; zbMATH DE number 4028877 (Why is no real title available?)
• scientific article; zbMATH DE number 3995644 (Why is no real title available?)

This page was built for publication: Positive program logics in systems with arithmetic

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