Limitations of the program memory and the expressive power of dynamic logics

DOI10.1006/INCO.1993.1018MaRDI QIDQ2365759zbMATH OpenOpenAlexFDO

Authors I. Kh. Musikaev, Michael A. Taitslin

Publication date 29 June 1993

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1993.1018

zbMATH Keywords

dynamic logicfree one-generated groupoid

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• The expressive power of memory logics
• Expressive Power and Decidability for Memory Logics
• Unbounded program memory adds to the expressive power of first-order programming logic
• ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS
• scientific article; zbMATH DE number 4028877
• scientific article; zbMATH DE number 3880106
• Static Memory Management for Logic Programming Languages
• scientific article; zbMATH DE number 3872671
• Memory propositional dynamic logic
• scientific article; zbMATH DE number 4179344

Cited in

(7)

• Unbounded program memory adds to the expressive power of first-order programming logic
• An infinite pebble game and applications
• In memoriam: Mikhail A. Taitslin, 1936--2013
• scientific article; zbMATH DE number 4112562 (Why is no real title available?)
• Identifier length and limited programmer memory
• Positive program logics in systems with arithmetic
• scientific article; zbMATH DE number 4028877 (Why is no real title available?)

This page was built for publication: Limitations of the program memory and the expressive power of dynamic logics

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