scientific article; zbMATH DE number 1501613

MaRDI QIDQ4500374zbMATH OpenFDO

Authors Alexander Rabinovich

Publication date 5 March 2001

zbMATH Keywords

duration calculussuccinctness

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1231602
• Expressive completeness of duration calculus.
• The succinctness of first-order logic on linear orders
• A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
• Comparing the succinctness of monadic query languages over finite trees

Cited in

(2)

• On the succinctness of some modal logics
• scientific article; zbMATH DE number 1231602 (Why is no real title available?)

This page was built for publication:

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