Extending Action Logic with Omega Iteration
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917132054298624 |
|---|---|
| author | Pshenitsyn, Tikhon |
| author_facet | Pshenitsyn, Tikhon |
| contents | We present a proof system that extends action logic by omega iteration, which is viewed as infinitary multiplicative conjunction. We prove cut admissibility and establish complexity bounds for the provability predicate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_06985 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Extending Action Logic with Omega Iteration Pshenitsyn, Tikhon Logic in Computer Science Logic We present a proof system that extends action logic by omega iteration, which is viewed as infinitary multiplicative conjunction. We prove cut admissibility and establish complexity bounds for the provability predicate. |
| title | Extending Action Logic with Omega Iteration |
| topic | Logic in Computer Science Logic |
| url | https://arxiv.org/abs/2512.06985 |