Two variable logic with ultimately periodic counting
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913297836539904 |
|---|---|
| author | Benedikt, Michael Kostylev, Egor V. Tan, Tony |
| author_facet | Benedikt, Michael Kostylev, Egor V. Tan, Tony |
| contents | We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of the logic are decidable. We also show that the spectrum of any sentence is definable in Presburger arithmetic. In the process we present several refinements to the ``biregular graph method''. In this method, decidability issues concerning two-variable logics are reduced to questions about Presburger definability of integer vectors associated with partitioned graphs, where nodes in a partition satisfy certain constraints on their in- and out-degrees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2006_01193 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Two variable logic with ultimately periodic counting Benedikt, Michael Kostylev, Egor V. Tan, Tony Logic in Computer Science Combinatorics We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of the logic are decidable. We also show that the spectrum of any sentence is definable in Presburger arithmetic. In the process we present several refinements to the ``biregular graph method''. In this method, decidability issues concerning two-variable logics are reduced to questions about Presburger definability of integer vectors associated with partitioned graphs, where nodes in a partition satisfy certain constraints on their in- and out-degrees. |
| title | Two variable logic with ultimately periodic counting |
| topic | Logic in Computer Science Combinatorics |
| url | https://arxiv.org/abs/2006.01193 |