Undecidability of partial order logics

DOI10.1016/S0020-0190(99)00005-8zbMATH Open1338.68165MaRDI QIDQ294640FDOQ294640

Authors: Rajeev Alur, Doron Peled 

Publication date: 16 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000058?np=y

Recommendations

• The decision problem for linear temporal logic
• scientific article; zbMATH DE number 3995064
• On undecidability of propositional temporal logics on trace systems
• Publication:4864475
• Decidability and incompleteness results for first-order temporal logics of linear time

zbMATH Keywords

program verificationspecification languagesprogram correctness

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cites Work

• Modeling concurrency with partial orders
• Title not available (Why is that?)
• Title not available (Why is that?)
• On undecidability of propositional temporal logics on trace systems
• Proving partial order properties
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Title not available (Why is that?)
• Notes on finite asynchronous automata
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Undecidability of compass logic
• Undecidability of the Logic of Partial Quasiary Predicates
• Temporal logics with incommensurable distances are undecidable

This page was built for publication: Undecidability of partial order logics

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