A simple dynamic logic

DOI10.1016/0304-3975(86)90032-0zbMath0612.03014OpenAlexW2094484747MaRDI QIDQ1087866

Petr Hájek

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90032-0

zbMATH Keywords

completenessconservationdynamic predicate logicnonstandard models of time

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items

Recursive programs and denotational semantics in absolute logics of programs, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, Total correctness in nonstandard logics of programs, Reasoning in Dynamic Logic about Program Termination, Hoare's logic for nondeterministic regular programs: A nonstandard approach

Cites Work

• A complete logic for reasoning about programs via nonstandard model theory. II
• The theory of semisets
• First-order dynamic logic
• Arithmetization of metamathematics in a general setting
• STRUCTURED NONSTANDARD DYNAMIC LOGIC
• Contributions to the Theory of Semisets II. The theory of semisets and end‐extensions in a syntactic setting
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Mathematical foundations of computer science 1978. Proceedings, 7th symposium Zakopane, Poland, September 4-8, 1978
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item