Results 121 to 130 of about 160,476 (167)

A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS

Zeitschrift Für Mathematische Logik Und Grundlagen Der Mathematik, 1992
AbstractModels for the Lambek calculus of syntactic categories surveyed here are based on frames that are in principle of the same type as Kripke frames for intuitionistic logic. These models are extracted from the literature on models for relevant logics, in particular the ternary relationed models introduced in the early seventies.
Kosta Dosen
exaly   +3 more sources

On syntactic concept lattice models for the Lambek calculus and infinitary action logic

Journal of Logic and Computation
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).
S. Kuznetsov
semanticscholar   +1 more source

On the Selective Lambek Calculus

2005
An intermediate logical system in comparison with the non-associative (NL) and the associative Lambek Calculus(L) is obtained by extending their language by means of a so-called “combining permission”, which is used to regulate the introduction of a product formula in the scope of a derivation and to impose a control on applications of the association ...
Marcelo da Silva Corrêa, Edward Hermann Haeusler   +1 more
openaire   +1 more source

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)

arXiv.org
We present Dependent Lambek Calculus, a domain-specific dependent type theory for verified parsing and formal grammar theory. In $\textrm{Lambek}^D$, linear types are used as a syntax for formal grammars,and parsers can be written as linear terms.
Steven Schaefer, Nathan Varner, P. Amorim, Max S. New   +3 more
semanticscholar   +1 more source

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

Journal of Logic, Language and Information, 2020
We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser.
M. Kanovich, S. Kuznetsov, A. Scedrov
semanticscholar   +1 more source

Deducibility in the full Lambek calculus with weakening is HAck-complete

Advances in Modal Logic
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of fast-growing ...
Vitor Greati, Revantha Ramanayake
semanticscholar   +1 more source

The Lambek calculus enriched with additional connectives

Journal of Logic, Language and Information, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Makoto Kanazawa
exaly   +2 more sources

Complexity of Nonassociative Lambek Calculus with classical logic

Non-Classical Logic. Theory and Applications
The Nonassociative Lambek Calculus (NL) represents a logic devoid of the structural rules of exchange, weakening, and contraction, and it does not presume the associativity of its connectives.
Paweł Płaczek
semanticscholar   +1 more source

Proof Nets for Lambek Calculus

Journal of Logic and Computation, 1992
The representation of a proof as you find it in textbooks is just a linear sequence of derivation steps. This does not mean that linear sequences of derivation steps are a good representation for computer generated and computer manipulated proofs. And in fact, for various calculi there are alternative and more compact representations of proofs, for ...
openaire   +3 more sources

On Finite Models of the Lambek Calculus

Studia Logica, 2005
The main result of the paper is a proof of the finite model property for the Lambek calculus with additive conjunction. This is a modification of \textit{W. Buszkowski}'s results for product-free fragments of the calculus [Math. Log. Q. 48, No. 1, 63--72 (2002; Zbl 0992.03029)]. In the paper under review, restricted cone frames are introduced.
openaire   +1 more source