Relational models for the Lambek calculus with local contraction subexponentials

Abstract The Lambek calculus has a natural class of interpretations on the algebra of binary relations, called R-models. We study extensions of the Lambek calculus with subexponential modalities, which allow structural rules of the local contraction (contracting neighbouring formulae decorated by the modality) and multi-contraction (contracting neighbouring sequences of such formulae). Local contraction has a natural meaning in R-models, namely, it corresponds to the property of a relation to be dense. We consider several logics with the local contraction subexponential, define the corresponding classes of R-models and prove completeness and incompleteness results.

Authors

Institutions

Publication Details

Journal
Journal of Logic and Computation
Published
2025-04-24
DOI
https://doi.org/10.1093/logcom/exaf030
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Relational models for the Lambek calculus with local contraction subexponentials

Stepan Kuznetsov, Mikhail Valinkin
Journal of Logic and Computation
Logic, programming, and type systems
article

Relational models for the Lambek calculus with local contraction subexponentials

Stepan Kuznetsov, Mikhail Valinkin
article en

Abstract

Abstract The Lambek calculus has a natural class of interpretations on the algebra of binary relations, called R-models. We study extensions of the Lambek calculus with subexponential modalities, which allow structural rules of the local contraction (contracting neighbouring formulae decorated by the modality) and multi-contraction (contracting neighbouring sequences of such formulae). Local contraction has a natural meaning in R-models, namely, it corresponds to the property of a relation to be dense. We consider several logics with the local contraction subexponential, define the corresponding classes of R-models and prove completeness and incompleteness results.

Journal of Logic and ComputationVol. 35(4)
Russian Academy of Sciences (RU), Steklov Mathematical Institute (RU)
Russian Science Foundation
Openalex Percentile: Top 95%
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Relational models for the Lambek calculus with local contraction subexponentials — Stepan Kuznetsov, Mikhail Valinkin · Journal of Logic and Computation (2025) | TGRS Research Map | TGRS