Generalising automaticity to modal properties of finite structures
From MaRDI portal
Publication:2373714
Recommendations
Cites work
- A restricted second order logic for finite structures
- An automata-theoretic approach to branching-time model checking
- Automaticity. I: Properties of a measure of descriptional complexity
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
- scientific article; zbMATH DE number 176754 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1954377 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Inflationary fixed points in modal logic
- Modal logic
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Rudiments of \(\mu\)-calculus
This page was built for publication: Generalising automaticity to modal properties of finite structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373714)