Paperlane

no. 16 · Tuesday 17 November 2026

Strong Standard Completeness of a Hypersequent Calculus for Cyclic Involutive Residuated Lattices

SanMin Wang

math.LO · □ lean · 102 pp

Abstract

We present a hypersequent calculus $H_R$ for cyclic involutive residuated lattices and prove strong standard completeness for arbitrary theories in a fixed countable propositional language. Standard models are chains on $[0,1]$; neither commutativity nor equality of the monoid unit and the dualizing constant is assumed. The chain semantics is the class $K_R$ defined by unit cyclicity and all ordered finite-history conditions. Every countable member of $K_R$ embeds into a standard chain preserving the entire signature. The construction combines central-support reconstruction, gap insertion and relative contraction. A relative comparison construction supplies the required chain countermodels. We also prove admissibility of the unrestricted density rule for theoremhood and effective elimination from finite proofs without additional assumption leaves. Elimination uses terminating enumeration of density-free proofs; ordinary Cut is retained, and no complexity bound is claimed. Further constructions give bounded standard embeddings for nontrivial countable chains of involutive uninorm logic and pseudo-uninorm logic with weak commutativity. Using ordinary chain completeness for arbitrary theories, these yield strong standard completeness for both logics. A companion Lean~4 development formalizes the main results, with its scope and external inputs stated explicitly.

comments
102 pages
fields
Logic
pdf ↗ page arXiv:2611.19940 ↗