Completeness theorem for a first order linear-time logic

zbMATH Open1265.03009MaRDI QIDQ2913981FDOQ2913981

Zoran Ognjanović

Publication date: 21 September 2012

Published in: Publications de l'Institut Mathématique. Nouvelle Série (Search for Journal in Brave)

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Arithmetical axiomatization of first-order temporal logic
• scientific article; zbMATH DE number 5790393
• Decidability and incompleteness results for first-order temporal logics of linear time
• A complete axiomatic characterization of first-order temporal logic of linear time
• Publication:2757840

Mathematics Subject Classification ID

Temporal logic (03B44)

Cited In (12)

• A PSPACE-complete first-order fragment of computability logic
• Arithmetical axiomatization of first-order temporal logic
• Decidability and incompleteness results for first-order temporal logics of linear time
• Probability logics for reasoning about quantum observations
• Title not available (Why is that?)
• The power of temporal proofs
• A complete axiomatic characterization of first-order temporal logic of linear time
• A propositional probabilistic logic with discrete linear time for reasoning about evidence
• Title not available (Why is that?)
• Concerning the semantic consequence relation in first-order temporal logic
• Incompleteness in linear time
• Title not available (Why is that?)

This page was built for publication: Completeness theorem for a first order linear-time logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913981)