27 citations · 49 across the 15 of their papers we have counts for
1 paper · 1 filter
Anupam Das
We study the logical complexity of proofs in cyclic arithmetic (CA), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $CΣ…