Abstract

The Quantified argument calculus (Quarc) has received a lot of attention recently as an interesting system of quantified logic which eschews the use of variables and unrestricted quantification, but nonetheless achieves results similar to the Predicate calculus (PC) by employing quantifiers applied directly to predicates instead. Despite this noted similarity, the issue of the relationship between Quarc and PC has so far not been definitively resolved. We address this question in the present paper, and then expand upon that result. Utilizing recent developments in structural proof theory, we develop a G3-style sequent calculus for Quarc and briefly demonstrate its structural properties. We put these properties to use immediately to construct direct proofs of the meta-theoretical properties of the system. We then incorporate an abstract (and, as we shall see, logical) predicate into the system in a way that preserves all the structural properties. This allows us to identify a system of Quarc which is deductively equivalent to PC, and also yields a constructive method of demonstrating the Craig interpolation theorem (which speaks in favor of the aforementioned predicate being logical). We further generalize this extension to develop a bivalent system of Quarc with defining clauses that still maintains all the desirable properties of a good proof system.