Ordered Monoids: Languages and Relations

2017/04/05 by Szabolcs Mikulás, Mikulas, Szabolcs
Computer Science · Arts and Humanities · #Advanced Algebra and Logic #Linguistics and Discourse Analysis #Logic, Reasoning, and Knowledge

paper · pdf · doi:10.48550/arxiv.1704.01391

Abstract

We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.

Related

• Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic
• On Language Varieties Without Boolean Operations
• A Language Hierarchy of Binary Relations
• Existence of monoids compatible with a family of mappings
• Characterizing NC1 with Typed Monoids