A note on the expressibility problem for modal logics and star-free regular expressions
From MaRDI portal
Publication:987808
Recommendations
Cites work
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 2129214 (Why is no real title available?)
- scientific article; zbMATH DE number 3861119 (Why is no real title available?)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
- Nonexistence of algorithms for recognizing syntactic expressibility in logic calculi. With a foreword by Iu. Reabuhin
- Rewriting of regular expressions and regular path queries
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
This page was built for publication: A note on the expressibility problem for modal logics and star-free regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987808)