Decidability and complexity via mosaics of the temporal logic of the lexicographic products of unbounded dense linear orders

DOI10.1007/978-3-642-40885-4_10zbMATH Open1398.03078OpenAlexW1875493920MaRDI QIDQ2849487FDOQ2849487

Authors: Philippe Balbiani, Szabolcs Mikulás 

Publication date: 20 September 2013

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40885-4_10

Recommendations

• About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability
• The decision problem for linear temporal logic
• The complexity of the temporal logic with ``until over general linear time
• The complexity of temporal logic over the reals
• Temporal logics over linear time domains are in PSPACE

zbMATH Keywords

complexitydecidabilitylinear temporal logicdecision procedurelexicographic productsatisfiability problemmosaic method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cited In (3)

• Title not available (Why is that?)
• The decision problem for linear temporal logic
• About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability

This page was built for publication: Decidability and complexity via mosaics of the temporal logic of the lexicographic products of unbounded dense linear orders

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