Abstract
Abstract The paper investigates from a proof-theoretic perspective various non-contractive logical systems, which circumvent logical and semantic paradoxes. Until recently, such systems only displayed additive quantifiers (Grišin and Cantini). Systems with multiplicative quantifiers were proposed in the 2010s (Zardini), but they turned out to be inconsistent with the naive rules for truth or comprehension. We start by presenting a first-order system for disquotational truth with additive quantifiers and compare it with Grišin set theory. We then analyze the reasons behind the inconsistency phenomenon affecting multiplicative quantifiers. After interpreting the exponentials in affine logic as vacuous quantifiers, we show how such a logic can be simulated within a truth-free fragment of a system with multiplicative quantifiers. Finally, we establish that the logic for these multiplicative quantifiers (but without disquotational truth) is consistent, by proving that an infinitary version of the cut rule can be eliminated. This paves the way to a syntactic approach to the proof theory of infinitary logic with infinite sequents.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
