Polynomial hierarchy graph properties in hybrid logic
From MaRDI portal
Publication:2453580
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 612169 (Why is no real title available?)
- scientific article; zbMATH DE number 1059246 (Why is no real title available?)
- scientific article; zbMATH DE number 1860675 (Why is no real title available?)
- Computer Science Logic
- Every Planar Map is Four Colorable
- Handbook of modal logic
- Hybrid logics: Characterization, interpolation and complexity
- The four-colour theorem
- Using modal logics to express and check global graph properties
Cited in
(3)
This page was built for publication: Polynomial hierarchy graph properties in hybrid logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453580)