Semiconic idempotent logic I: Structure and local deduction theorems

Abstract

Semiconic idempotent logic is a common generalization of intuitionistic logic, relevance logic with mingle, and semilinear idempotent logic. It is an algebraizable logic and it admits a cut-free hypersequent calculus. We give a structural decomposition of its characteristic algebraic semantics, conic idempotent residuated lattices, showing that each of these is an ordinal sum of simpler partially ordered structures. This ordinal sum is indexed by a totally ordered residuated lattice, which serves as its skeleton and is both a subalgebra and nuclear image. We equationally characterize the totally ordered residuated lattices appearing as such skeletons. Further, we describe both congruence and subalgebra generation in conic idempotent residuated lattices, proving that every variety generated by these enjoys the congruence extension property. In particular, this holds for semilinear idempotent residuated lattices. Based on this analysis, we obtain a local deduction theorem for semiconic idempotent logic, which also specializes to semilinear idempotent logic.