The vertical non-uniqueness conjecture for PC connectives outside PU

Less than 1 year old · traced to

Let PC\texttt{PC} and PU\texttt{PU} be the classes of connectives defined in the paper. Let vertical interderivability mean that, for a connective #\texttt{\#}, the corresponding labelled sequents involving #\texttt{\#} and its companion connective \natural\texttt{\natural} derive one another in the relevant dimension. A connective is vertically unique when it satisfies this interderivability condition.

Vertical non-uniqueness conjecture. For every connective #\texttt{\#}, if #∈PC\texttt{\#}\in\texttt{PC} but #∉PU\texttt{\#}\notin\texttt{PU}, then #\texttt{\#} is not vertically interderivable, and hence is non-unique according to Definition 16.

The conjecture would classify all connectives in PC∖PU\texttt{PC}\setminus\texttt{PU} as non-unique under the paper's preferred Belnap-style notion. The source states that proof-search complexity prevents establishing it and leaves it for future research.

References

Primary source

Sophie Nagler, “Inference-Behaviour Semantics for All^Connectives in Two-Dimensional Sequent Calculi”, arXiv:2607.19419 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.