Name
Abstract | ||
|---|---|---|
In the past years, extensions of monadic second-order logic (MSO) that can specify boundedness properties by the use of operators referring to the sizes of sets have been considered. In particular, the logics costMSO introduced by T. Colcombet and MSO+U by M. Bojanczyk were analyzed and connections to automaton models have been established to obtain decision procedures for these logics. In this work, we propose the logic quantitative counting MSO (qcMSO for short), which combines aspects from both costMSO and MSO+U. We show that both logics can be embedded into qcMSO in a natural way. Moreover, we provide a decidability proof for the theory of its weak variant (quantification only over finite sets) for the natural numbers with order and the infinite binary tree. These decidability results are obtained using a regular cost function extension of automatic structures called resource-automatic structures. |
Year | Venue | Field |
|---|---|---|
2015 | CSL | Discrete mathematics,Natural number,Combinatorics,Public records,Finite set,Automaton,Binary tree,Decidability,Operator (computer programming),Monad (functional programming),Mathematics |
DocType | Citations | PageRank |
Conference | 1 | 0.36 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Łukasz Kaiser | 1 | 2307 | 89.08 |
| Martin Lang 0001 | 2 | 1 | 0.69 |
| Simon R. Leßenich | 3 | 4 | 0.82 |
| Christof Löding | 4 | 326 | 28.57 |