Expressive power of monadic logics on words, trees, pictures, and graphs
From MaRDI portal
Publication:3086932
Recommendations
Cited in
(18)- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
- Computer Science Logic
- Subshifts, Languages and Logic
- Counting on CTL^*: On the expressive power of monadic path logic
- A duality theoretic view on limits of finite structures
- Expressiveness and complexity of graph logic
- A logical approach to locality in pictures languages
- scientific article; zbMATH DE number 1223636 (Why is no real title available?)
- scientific article; zbMATH DE number 1841812 (Why is no real title available?)
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
- Second-order propositional modal logic and monadic alternation hierarchies
- Regular sets over extended tree structures
- scientific article; zbMATH DE number 7471705 (Why is no real title available?)
- Monadic structures over an ordered universal random graph and finite automata
- Where first-order and monadic second-order logic coincide
- Prefix-Recognizable Graphs and Monadic Logic
- scientific article; zbMATH DE number 1519892 (Why is no real title available?)
- Subshifts as models for MSO logic
This page was built for publication: Expressive power of monadic logics on words, trees, pictures, and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086932)
