The strength of the SCT criterion
Emanuele Frittaion, Silvia Steila, Keita Yokoyama
TL;DR
This paper explores the theoretical foundations of the SCT criterion within Reverse Mathematics, establishing its equivalence to a specific induction scheme over a base system.
Contribution
It proves that the SCT criterion is equivalent to -induction over RCAa00, linking program analysis to foundational mathematical principles.
Findings
SCT criterion is equivalent to -induction over RCAa00
Establishes a foundational connection between size-change analysis and Reverse Mathematics
Provides a new perspective on the logical strength of the SCT criterion
Abstract
We undertake the study of size-change analysis in the context of Reverse Mathematics. In particular, we prove that the SCT criterion is equivalent to -induction over RCA.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Benford’s Law and Fraud Detection · Markov Chains and Monte Carlo Methods