Pages that link to "Item:Q915718"
From MaRDI portal
The following pages link to On the interpretability of arithmetic in temporal logic (Q915718):
Displaying 17 items.
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- Arithmetical axiomatization of first-order temporal logic (Q1101100) (← links)
- The power of temporal proofs (Q1118578) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- Saturated calculus for Horn-like sequents of a complete class of a linear temporal first order logic (Q1807462) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Invertible infinitary calculus without loop rules for restricted FTL (Q2577594) (← links)
- Linear-time temporal logics with Presburger constraints: an overview ★ (Q3647243) (← links)
- Decidability and incompleteness results for first-order temporal logics of linear time (Q4275689) (← links)
- (Q4797374) (← links)
- A Branching Time Logical System for Open Distributed Systems Development (Q4916209) (← links)
- Similarity saturation for first order linear temporal logic with UNLESS (Q5236443) (← links)
- Proof-theoretical investigation of temporal logic with time gaps (Q5930981) (← links)
- Incompleteness of a first-order Gödel logic and some temporal logics of programs (Q6560158) (← links)
