Monadic monadic second order logic
From MaRDI portal
Publication:6612795
DOI10.1007/978-3-031-24117-8_19MaRDI QIDQ6612795
Mikołaj Bojańczyk, Julian Salamanca, Bartek Klin
Publication date: 1 October 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finitely generated idempotent semigroups.
- The monadic theory of order
- General varieties of tree languages
- Relation categories and coproduct congruence categories in universal algebra
- Algebra for trees
- Monads, partial evaluations, and rewriting
- Iterated covariant powerset is not a monad
- The monads of classical algebra are seldom weakly Cartesian
- Tree acceptors and some of their applications
- Models in equational theories of unary algebras
- Free lattices.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Regular Languages of Words over Countable Linear Orderings
- Recognisable Languages over Monads
- Decision Problems of Finite Automata Design and Related Arithmetics
- On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
- The Sch\"utzenberger product for syntactic spaces
- Definability equals recognizability for graphs of bounded treewidth
- Open Problems About Regular Languages, 35 Years Later
- Relating Structure and Power: Comonadic Semantics for Computational Resources
- Quantifiers on languages and codensity monads
- Definable decompositions for graphs of bounded linear cliquewidth
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Automata in general algebras
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Theories of analytic monads
This page was built for publication: Monadic monadic second order logic
