Quantifiers on languages and codensity monads
DOI10.1017/S0960129521000074zbMath1495.68145OpenAlexW3173836769MaRDI QIDQ5006459
Luca Reggio, Mai Gehrke, Daniela Petrişan
Publication date: 16 August 2021
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129521000074
Stone dualityformal languageslogic on wordscodensity monadssemiring quantifierssemiring-valued measures
Logic in computer science (03B70) Algebraic theory of languages and automata (68Q70) Semirings (16Y60) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular languages and Stone duality
- Profinite categories and semidirect products
- Regular languages defined with generalized quantifiers
- Codensity, profiniteness and algebras of semiring-valued measures
- Monads on symmetric monoidal closed categories
- Equational completion, model induced triples and pro-objects
- The formal theory of monads
- Profinite Monads, Profinite Equations, and Reiterman’s Theorem
- Schützenberger Products in a Category
- Codensity and the ultrafilter monad
- Recognisable Languages over Monads
- Duality and Equational Theory of Regular Languages
- A Topological Approach to Recognition
- The Sch\"utzenberger product for syntactic spaces
- Varieties of Languages in a Category
- Quantifiers on languages and codensity monads
- Logic Meets Algebra: the Case of Regular Languages
- The Theory of Representation for Boolean Algebras
This page was built for publication: Quantifiers on languages and codensity monads