Strong Standard Completeness of a Hypersequent Calculus for Cyclic Involutive Residuated Lattices
SanMin Wang
math.LO
Nov 15, 2026 · v1
TL;DR
A companion Lean 4 development machine-checks the full standard representation theorem, strong standard completeness for H_R, and an executable density-elimination procedure.
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.
Problem
Strong standard completeness, meaning completeness with respect to chains on [0,1] for arbitrary theories, was open for a hypersequent calculus of cyclic involutive residuated lattices. The setting assumes neither commutativity nor equality of the monoid unit and the dualizing constant.
Approach
The authors define a hypersequent calculus H_R whose chain semantics is the class K_R, given by unit cyclicity and ordered finite-history conditions. They prove that every countable member of K_R fully embeds into a standard chain, using central-support reconstruction, gap insertion, relative contraction and Dedekind–MacNeille completion. A relative comparison construction supplies countable chain countermodels. A companion Lean 4 development (v1.1.0, on Zenodo) machine-checks the main results; its scope and external inputs are stated explicitly.
Results
Strong standard completeness is proved for H_R, together with admissibility and effective elimination of the density rule for finite proofs, with ordinary Cut retained. Bounded standard embeddings give strong standard completeness for IUL and HpsUL*. The Lean development verifies the representation theorem, the comparison construction, and completeness for H_R.