Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics

DOI10.1016/0168-0072(93)90148-7zbMath0789.03028OpenAlexW2090287663MaRDI QIDQ687278

Balázs Biró, Ildikó Sain

Publication date: 28 November 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90148-7

zbMATH Keywords

dynamic logictemporal logicPeano Arithmeticpartial correctnessprogram verificationdata theorymultiplication of time pointsPresburger Arithmetic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Total correctness in nonstandard logics of programs
• On the strength of temporal proofs
• Corrigendum to: ``The power of temporal proofs
• A simple dynamic logic
• The power of temporal proofs
• A complete logic for reasoning about programs via nonstandard model theory. II
• Temporal logics need their clocks
• Model theory
• Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
• Tense systems with discrete moments of time. I
• STRUCTURED NONSTANDARD DYNAMIC LOGIC
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics