On the logical complexity of cyclic arithmetic

We study the logical complexity of proofs in cyclic arithmetic ($\mathsf{CA}$), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $C\Sigma_n$ for (the logical consequences of) cyclic proofs containing only $\Sigma_n$ formulae, our main result is th...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 16, Issue 1
Main Author:	Das, Anupam
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2020
Subjects:	computer science - logic in computer science mathematics - logic
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!