On syntactic concept lattice models for the Lambek calculus and infinitary action logic
By: Stepan L. Kuznetsov
Potential Business Impact:
Makes computer language rules work with infinite words.
The linguistic applications of the Lambek calculus suggest its semantics over algebras of formal languages. A straightforward approach to construct such semantics indeed yields a brilliant completeness theorem (Pentus 1995). However, extending the calculus with extra operations ruins completeness. In order to mitigate this issue, Wurm (2017) introduced a modification of this semantics, namely, models over syntactic concept lattices (SCLs). We extend this semantics to the infinitary extension of the Lambek calculus with Kleene iteration (infinitary action logic), prove strong completeness and some interesting corollaries. We also discuss issues arising with constants - zero, unit, top - and provide some strengthenings of Wurm's results towards including these constants into the systems involved.
Similar Papers
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.
An Algebraic Extension of Intuitionistic Linear Logic: The $L_!^S$-Calculus and Its Categorical Model
Logic in Computer Science
Makes math rules for quantum computer programs.
CoLF Logic Programming as Infinitary Proof Exploration
Logic in Computer Science
Lets computers build complex proofs with infinite parts.