On the interpretability of arithmetic in temporal logic

DOI10.1016/0304-3975(90)90161-AzbMath0703.03004MaRDI QIDQ915718

Fred Kröger

Publication date: 1990

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

zbMATH Keywords

arithmeticextending first-order temporal theories

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items

Completeness of a first-order temporal logic with time-gaps ⋮ Decidability and incompleteness results for first-order temporal logics of linear time ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ A decidability result for the model checking of infinite-state systems ⋮ A Branching Time Logical System for Open Distributed Systems Development ⋮ The scope of Gödel's first incompleteness theorem ⋮ Proof-theoretical investigation of temporal logic with time gaps ⋮ LTL over integer periodicity constraints ⋮ Saturated calculus for Horn-like sequents of a complete class of a linear temporal first order logic ⋮ Linear-time temporal logics with Presburger constraints: an overview ★ ⋮ Similarity saturation for first order linear temporal logic with UNLESS ⋮ Invertible infinitary calculus without loop rules for restricted FTL

Cites Work

• Concerning the semantic consequence relation in first-order temporal logic
• Incompleteness of first-order temporal logic with until
• Model theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the interpretability of arithmetic in temporal logic