Asymptotic Monadic Second-Order Logic

@inproceedings{Blumensath2014AsymptoticMS,
  title={Asymptotic Monadic Second-Order Logic},
  author={Achim Blumensath and Olivier Carton and Thomas Colcombet},
  booktitle={MFCS},
  year={2014}
}
In this paper we introduce so-called asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic Second-Order Logic over infinite words. This is a logic talking about ωwords labelled by integers. It contains full monadic second-order logic and can express asymptotic properties of integers labellings. We also introduce several variants of this logic and investigate their relationship to the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Weak MSO with the Unbounding Quantifier

STACS • 2009
View 4 Excerpts
Highly Influenced

The monadic theory of order

S. Shelah
Annals of Math., 102:379–419, • 1975
View 4 Excerpts
Highly Influenced

Regular Cost Functions, Part I: Logic and Algebra over Words

Logical Methods in Computer Science • 2012
View 1 Excerpt

Regular Cost Functions over Finite Trees

2010 25th Annual IEEE Symposium on Logic in Computer Science • 2010
View 1 Excerpt

Similar Papers

Loading similar papers…