Completeness of a first-order temporal logic with time-gaps
From MaRDI portal
Publication:1350524
DOI10.1016/0304-3975(95)00107-7zbMATH Open0872.68171OpenAlexW2016280880MaRDI QIDQ1350524FDOQ1350524
Richard Zach, Matthias Baaz, Alexander Leitsch
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://philarchive.org/rec/BAACOA
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concerning the semantic consequence relation in first-order temporal logic
- Incompleteness of first-order temporal logic with until
- Proof methods for modal and intuitionistic logics
- On the interpretability of arithmetic in temporal logic
- The Universe of Set Theory
- Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p
- The Undecidability of Monadic Modal Quantification Theory
- Proof strategies in linear logic
Cited In (8)
- Title not available (Why is that?)
- Incompleteness of a first-order Gödel logic and some temporal logics of programs
- Loop-type sequent calculi for temporal logic
- REASONING ABOUT TRANSFINITE SEQUENCES
- A non-hyperarithmetical Gödel logic
- Continuous Fraïssé conjecture
- Proof-theoretical investigation of temporal logic with time gaps
- First-order Gödel logics
This page was built for publication: Completeness of a first-order temporal logic with time-gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350524)