Arnon Avron ; Anna Zamansky - Canonical calculi with (n,k)-ary quantifiers

lmcs:1139 - Logical Methods in Computer Science, August 6, 2008, Volume 4, Issue 3 - https://doi.org/10.2168/LMCS-4(3:2)2008
Canonical calculi with (n,k)-ary quantifiers

Authors: Arnon Avron ; Anna Zamansky

Propositional canonical Gentzen-type systems, introduced in 2001 by Avron and Lev, are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no other connective is mentioned. A constructive coherence criterion for the non-triviality of such systems was defined and it was shown that a system of this kind admits cut-elimination iff it is coherent. The semantics of such systems is provided using two-valued non-deterministic matrices (2Nmatrices). In 2005 Zamansky and Avron extended these results to systems with unary quantifiers of a very restricted form. In this paper we substantially extend the characterization of canonical systems to (n,k)-ary quantifiers, which bind k distinct variables and connect n formulas, and show that the coherence criterion remains constructive for such systems. Then we focus on the case of k∈{0,1} and for a canonical calculus G show that it is coherent precisely when it has a strongly characteristic 2Nmatrix, which in turn is equivalent to admitting strong cut-elimination.


Volume: Volume 4, Issue 3
Published on: August 6, 2008
Accepted on: June 25, 2015
Submitted on: February 1, 2007
Keywords: Computer Science - Logic in Computer Science,F.4.1


Share

Consultation statistics

This page has been seen 237 times.
This article's PDF has been downloaded 142 times.