The serializability problem for a temporal logic of transaction queries

DOI10.3166/JANCL.18.67-78zbMath1187.03017MaRDI QIDQ3647287

Walter Hussak

Publication date: 30 November 2009

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

zbMATH Keywords

decidabilityserializabilityfirst-order temporal logic

Mathematics Subject Classification ID

Database theory (68P15) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cites Work

• Proving partial order properties
• Decidable fragments of first-order temporal logics
• Decidability of infinite-state timed CCP processes and first-order LTL
• Axiomatizing the monodic fragment of first-order temporal logic
• Equality and monodic first-order temporal logic
• The serializability of concurrent database updates
• Decidability and incompleteness results for first-order temporal logics of linear time
• Serializable histories in quantified propositional temporal logic

This page was built for publication: The serializability problem for a temporal logic of transaction queries