Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2511.02596 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912687640805376 |
|---|---|
| author | Bruse, Florian Kronenberger, David Lange, Martin |
| author_facet | Bruse, Florian Kronenberger, David Lange, Martin |
| contents | The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we extend this result to characterizations of k-EXPSPACE-queries for arbitrary k, characterizing them as exactly those expressible in order-k+1-higher-order logic with partial fixpoints. For k>1, the restriction to ordered structures is no longer necessary due to the high expressive power of higher-order logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_02596 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints Bruse, Florian Kronenberger, David Lange, Martin Logic in Computer Science The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we extend this result to characterizations of k-EXPSPACE-queries for arbitrary k, characterizing them as exactly those expressible in order-k+1-higher-order logic with partial fixpoints. For k>1, the restriction to ordered structures is no longer necessary due to the high expressive power of higher-order logic. |
| title | Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2511.02596 |