Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2011.02895

Lambek-Grishin Calculus: Focusing, Display and Full Polarization

Giuseppe Greco·Valentin D. Richard·Michael Moortgat·Apostolos Tzimoulis
View original source ↗Read source document ↗Export metadata ↓

Abstract

\emph{Focused sequent calculi} are a refinement of sequent calculi, where additional side-conditions on the applicability of inference rules force the implementation of a proof search strategy. Focused cut-free proofs exhibit a special normal form that is used for defining identity of sequent calculi proofs. We introduce a novel focused display calculus fD.LG and a fully polarized algebraic semantics FP.LG for Lambek-Grishin logic by generalizing the theory of \emph{multi-type calculi} and their algebraic semantics with \emph{heterogenous consequence relations}. The calculus fD.LG has \emph{strong focalization} and it is \emph{sound and complete} w.r.t. FP.LG. This completeness result is in a sense stronger than completeness with respect to standard polarized algebraic semantics (see e.g. the phase semantics of Bastenhof for Lambek-Grishin logic or Hamano and Takemura for linear logic), insofar we do not need to quotient over proofs with consecutive applications of shifts over the same formula. We plan to investigate the connections, if any, between this completeness result and the notion of \emph{full completeness} introduced by Abramsky et al. We also show a number of additional results. fD.LG is sound and complete w.r.t. LG-algebras: this amounts to a semantic proof of the so-called \emph{completeness of focusing}, given that the standard (display) sequent calculus for Lambek-Grishin logic is complete w.r.t. LG-algebras. fD.LG and the focused calculus f.LG of Moortgat and Moot are equivalent with respect to proofs, indeed there is an effective translation from f.LG-derivations to fD.LG-derivations and vice versa: this provides the link with operational semantics, given that every f.LG-derivation is in a Curry-Howard correspondence with a directional $\overline\lambda\mu\widetilde{\mu}$-term.

Explore related subjects

math.LOcs.LO

Keep this discovery

BibTeXRIS

Giuseppe Greco, Valentin D. Richard, Michael Moortgat, Apostolos Tzimoulis. 2020-11-05. Lambek-Grishin Calculus: Focusing, Display and Full Polarization. https://arxiv.org/abs/2011.02895

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗