Skip to main content

Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We compare the monadic second-order theory of an arbitrary linear ordering L with the theory of the family of subsets of L endowed with the operation on subsets obtained by lifting the max operation on L. We show that the two theories define the same relations. The same result holds when lifting the min operation or both max and min operations.

Cite

CITATION STYLE

APA

Choffrut, C., & Grigorieff, S. (2015). Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9300, pp. 109–128). Springer Verlag. https://doi.org/10.1007/978-3-319-23534-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free