Decidability of MSO reparameterization over countable chains
From MaRDI portal
Cites work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Expressing cardinality quantifiers in monadic second-order logic over chains
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- On the growth rates of polyregular functions
- The monadic theory of order
- Undecidable theories
This page was built for publication: Decidability of MSO reparameterization over countable chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411241)