Arithmetical axiomatization of first-order temporal logic

DOI10.1016/0020-0190(87)90047-0zbMath0642.03018OpenAlexW2015571575MaRDI QIDQ1101100

Andrzej Szałas

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90047-0

zbMATH Keywords

Kripke structuresarithmetical completenessfirst-order temporal logicarithmetical axiomatizations of logics of programsarithmetical proof systemsarithmetical soundness

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items

A complete axiomatic characterization of first-order temporal logic of linear time, Axiomatizing fixpoint logics, On strictly arithmetical completeness in logics of programs, Axiomatising first-order temporal logic: Until and since over linear time

Cites Work

• A generalized nexttime operator in temporal logic
• Concerning the semantic consequence relation in first-order temporal logic
• A complete axiomatic characterization of first-order temporal logic of linear time
• Incompleteness of first-order temporal logic with until
• First-order dynamic logic
• Soundness and Completeness of an Axiom System for Program Verification
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item