scientific article; zbMATH DE number 3827831

Cited in

(24)

Preservation of expressive completeness in temporal models
Expressive completeness failure in branching time structures
Modal languages and bounded fragments of predicate logic
Expressiveness of concept expressions in first-order description logics
Combining temporal logic systems
Deciding the guarded fragments by resolution
Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
On the expressive power of first-order modal logic with two-dimensional operators
Deciding regular grammar logics with converse through first-order logic
On the relative expressiveness of description logics and predicate logics
Two-Variable Separation Logic and Its Inner Circle
A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time
Separation logics and modalities: a survey
A proof of Stavi's theorem
It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
\(\mathrm{FO}=\mathrm{FO}^3\) for linear orders with monotone binary relations
Expressive completeness of separation logic with two variables and no separating conjunction
Efficient and Expressive Tree Filters
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
An algebraic semantics for possibilistic finite-valued Łukasiewicz logic
The \(k\)-variable property is stronger than H-dimension \(k\)
Definability with bounded number of bound variables
Model checking memoryful linear-time logics over one-counter automata

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 Q3674621)