On strictly arithmetical completeness in logics of programs

DOI10.1016/0304-3975(91)90336-ZzbMath0725.03012OpenAlexW2156760071MaRDI QIDQ2277248

Andrzej Szałas

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90336-z

zbMATH Keywords

temporal logiclogics of programsalgorithmic logicconcurrent dynamic logicstrictly arithmetical completeness of an axiom systemstrictly arithmetical interpretations

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items

Axiomatizing fixpoint logics, On the Completeness of Dynamic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concerning the semantic consequence relation in first-order temporal logic
• Arithmetical axiomatization of first-order temporal logic
• Some relationships between logics of programs and complexity theory
• Incompleteness of first-order temporal logic with until
• A complete logic for reasoning about programs via nonstandard model theory. II
• First-order dynamic logic
• On static logics, dynamic logics, and complexity classes
• Concurrent dynamic logic
• Soundness and Completeness of an Axiom System for Program Verification