About the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders: A New Study of Its Computability

DOI10.1007/978-981-15-1342-8_3zbMath1484.03030OpenAlexW3004297923MaRDI QIDQ3298275

Philippe Balbiani

Publication date: 14 July 2020

Published in: Logic in Asia: Studia Logica Library (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-1342-8_3

zbMATH Keywords

complexitydecidabilitysatisfiability problemlinear temporal logiclexicographic productdecision proceduremosaic method

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Total orders (06A05) Temporal logic (03B44)

Cites Work

• Unnamed Item
• A non-standard temporal deductive database system
• Finite model theory and its applications.
• A decidable temporal logic of parallelism
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse.
• Many-dimensional modal logics: theory and applications
• On the mosaic method for many-dimensional modal logics: a case study combining tense and modal operators
• Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders
• Axiomatization and Completeness of Lexicographic Products of Modal Logics
• All Finitely Axiomatizable Normal Extensions of K4.3 are Decidable
• Products of modal logics, part 1
• On the Products of Linear Modal Logics
• That All Normal Extensions of S4.3 Have the Finite Model Property
• The Logics Containing S 4.3

This page was built for publication: About the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders: A New Study of Its Computability