Monadic monadic second order logic

DOI10.1007/978-3-031-24117-8_19MaRDI QIDQ6612795zbMATH OpenFDO

Authors Mikołaj Bojańczyk, Bartek Klin, Julian Salamanca

Publication date 1 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-24117-8_19

zbMATH Keywords

monadmonadic second order logicrecognizable language distributive law

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Quantum computation (81P68)

Cites work

• A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
• Algebra for trees
• Automata in general algebras
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decision Problems of Finite Automata Design and Related Arithmetics
• Definability equals recognizability for graphs of bounded treewidth
• Definable decompositions for graphs of bounded linear cliquewidth
• Free lattices.
• General varieties of tree languages
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Graph structure and monadic second-order logic. A language-theoretic approach
• scientific article; zbMATH DE number 2125667 (Why is no real title available?)
• scientific article; zbMATH DE number 5761737 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 44695 (Why is no real title available?)
• scientific article; zbMATH DE number 195199 (Why is no real title available?)
• scientific article; zbMATH DE number 758787 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• scientific article; zbMATH DE number 3296291 (Why is no real title available?)
• scientific article; zbMATH DE number 3071073 (Why is no real title available?)
• Iterated covariant powerset is not a monad
• Models in equational theories of unary algebras
• Monads, partial evaluations, and rewriting
• No-go theorems for distributive laws
• On finitely generated idempotent semigroups.
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• Open problems about regular languages, 35 years later
• Quantifiers on languages and codensity monads
• Recognisable languages over monads
• Regular languages of words over countable linear orderings
• Relating structure and power: comonadic semantics for computational resources
• Relation categories and coproduct congruence categories in universal algebra
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The monadic theory of order
• The monads of classical algebra are seldom weakly Cartesian
• The Schützenberger product for syntactic spaces
• Theories of analytic monads
• Trace semantics for coalgebras
• Tree acceptors and some of their applications

Cited in

(1)

• Context-free languages of string diagrams

This page was built for publication: Monadic monadic second order logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612795)