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_10zbMath1398.03078OpenAlexW1875493920MaRDI QIDQ2849487

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

zbMATH Keywords

complexitydecidabilitysatisfiability problemlinear temporal logiclexicographic productdecision proceduremosaic method

Mathematics Subject Classification ID

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

Related Items (1)

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