Temporal logics need their clocks

DOI10.1016/0304-3975(92)90067-PzbMath0751.03010MaRDI QIDQ1186428

Ildikó Sain

Publication date: 28 June 1992

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

zbMATH Keywords

completenessfirst-order temporal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items

Derivation rules as anti-axioms in modal logic, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, Similarity saturation for first order linear temporal logic with UNLESS, On the strength of temporal proofs

Cites Work

• Total correctness in nonstandard logics of programs
• On the strength of temporal proofs
• Corrigendum to: ``The power of temporal proofs
• The power of temporal proofs
• Weak second order characterizations of various program verification systems
• A complete logic for reasoning about programs via nonstandard model theory. I
• A complete logic for reasoning about programs via nonstandard model theory. II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item