A complete system of deduction for Sigma formulas
Andre Kornell

TL;DR
This paper introduces a deduction system using only Sigma formulas, providing a complete, finitistic framework that captures classical and intuitionistic reasoning, and connects to primitive recursive arithmetic and reverse mathematics.
Contribution
It develops a complete Sigma-formula-based deduction system that explicitly models finitistic reasoning and relates to PRA and reverse mathematics.
Findings
The system is complete for Sigma formulas.
It distinguishes classical from intuitionistic reasoning via a distributive law.
Implications of Sigma formulas are characterized within reverse mathematics.
Abstract
The Sigma formulas of the language of arithmetic express semidecidable relations on the natural numbers. More generally, whenever a totality of objects is regarded as incomplete, the Sigma formulas express relations that are witnessed in a completed portion of that totality when they hold. In this sense, the Sigma formulas are more concrete semantically than other first-order formulas. We describe a system of deduction that uses only Sigma formulas. Each axiom, an implication between two Sigma formulas, is implemented as a rewriting rule for subformulas. We exhibit a complete class of logical axioms for this system, and we observe that a distributive law distinguishes classical reasoning from intuitionistic reasoning in this setting. Skolem's theory PRA of primitive recursive arithmetic can be formulated in our deductive system. In Skolem's system, free variables are universally…
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
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms
