Score: 0
Extending Action Logic with Omega Iteration
Published: December 7, 2025 |
arXiv ID: 2512.06985v1
By: Tikhon Pshenitsyn
Potential Business Impact:
Proves math ideas with infinite steps.
Business Areas:
Artificial Intelligence
Artificial Intelligence, Data and Analytics, Science and Engineering, Software
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.
Similar Papers
87%
The Limit of Recursion in State-based Systems
Logic in Computer Science
Proves how fast some computer programs finish.
4 Nov 2025
0
85%
On syntactic concept lattice models for the Lambek calculus and infinitary action logic
Logic in Computer Science
Makes computer language rules work with infinite words.
28 Oct 2025
0
85%
Optimistic Higher-Order Superposition
Logic in Computer Science
Makes proving hard math problems much faster.
21 Oct 2025
1
Page Count
6 pages
Category
Computer Science:
Logic in Computer Science